Parallel machine scheduling with high multiplicity

Abstract.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.

[1]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[2]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[3]  Ellis Horowitz,et al.  Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

[4]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[5]  Marc E. Posner,et al.  High Multiplicity in Earliness-Tardiness Scheduling , 2000, Oper. Res..

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[8]  Ron Shamir,et al.  Minimizing the number of tardy job units under release time constraints , 1990, Discret. Appl. Math..

[9]  John Joseph Clifford.  Machine scheduling with high multiplicity , 1997 .

[10]  Ron Shamir,et al.  A polynomial algorithm for an integer quadratic non-separable transportation problem , 1992, Math. Program..

[11]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[12]  F. B. Hildebrand.  Finite-difference equations and simulations , 1968 .

[13]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[14]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[15]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[16]  Shui Lam,et al.  A Level Algorithm for Preemptive Scheduling , 1977, J. ACM.

[17]  J. George Shanthikumar,et al.  Convex separable optimization is not much harder than linear optimization , 1990, JACM.

[18]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[19]  W. A. Horn.  Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

[20]  M. Marden.  Geometry of Polynomials , 1970 .

[21]  Teofilo F. Gonzalez,et al.  Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[22]  Jadranka Skorin-Kapov,et al.  On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem , 1993, Discret. Appl. Math..

[23]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Approach for Sequencing Groups of Identical Jobs , 1980, Oper. Res..

[24]  Toshio Hamada,et al.  A Bayesian sequential single machine scheduling problem to minimize the expected weighted sum of flowtimes of jobs with exponential processing times , 1993 .

[25]  Ron Shamir,et al.  Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem , 1991, Oper. Res..

[26]  Seiki Kyan,et al.  Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem , 1986, SIAM J. Comput..

[27]  Frits C. R. Spieksma,et al.  Polynomial algorithms for multiprocessor scheduling with a small number of job lengths , 1997, SODA '97.

[28]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .