Mathematical Programming

, Volume 89, Issue 3, pp 359–383

Parallel machine scheduling with high multiplicity

  • John J. Clifford
  • Marc E. Posner

DOI: 10.1007/PL00011403

Cite this article as:
Clifford, J. & Posner, M. Math. Program. (2001) 89: 359. doi:10.1007/PL00011403


In high-multiplicity scheduling problems, identical jobs are encoded in the efficient format of describing one of the jobs and the number of identical jobs. Similarly, identical machines are efficiently encoded in the same manner. We investigate parallel-machine, high-multiplicity problems, where there are three possible machine speed structures: identical, proportional, or unrelated. For the objectives of minimizing the sum of job completion times and minimizing the makespan, we consider both nonpreemptive and preemptive problems. For some problems, we develop polynomial time algorithms. For several problems, we demonstrate that the recognition versions can be solved in polynomial time, while the optimization versions require pseudo-polynomial time. We also show that changing from standard binary encoding to high-multiplicity encoding does not affect the complexity class of NP-complete problems.

Key words: sequencing – deterministic – parallel machine – high multiplicity – computational complexity
Mathematics Subject Classification (2000): 90-08, 90B35

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • John J. Clifford
    • 1
  • Marc E. Posner
    • 2
  1. 1.Center for Naval Analysis, 4825 Markcenter Drive, Alexandria, VA 22311-1850, USAUS
  2. 2.The Ohio State University, Industrial Engineering, 1971 Neil Avenue, Columbus, Ohio 43210-1271, USAUS