We consider the following problem. There are m parallel machines and n independent jobs. Each job is to be assigned to one of the machines. The processing of job j on machine i requires time P ij . The objective is to find a schedule that minimizes the makespan.
|Title of host publication||Operations Research Proceedings 1987 (Papers of the 16th Annual Meeting of DGOR, in cooperation with NSOR, Veldhoven, The Netherlands, September 23-25, 1987)|
|Editors||H. Schellhaas, P. Beek, van, H. Isermann, R. Schmidt, M. Zijlstra|
|Place of Publication||Berlin|
|Publication status||Published - 1988|