A Framework for the Complexity of High-Multiplicity Scheduling Problems

The purpose of this note is to propose a complexity framework for the analysis of high multiplicity scheduling problems. Part of this framework relies on earlier work aiming at the definition of output-sensitive complexity measures for the analysis of algorithms which produce “large” outputs. However, different classes emerge according as we look at schedules as sets of starting times, or as related single-valued mappings.

[1]  Sigrid Knust,et al.  Makespan minimization for flow-shop problems with transportation times and a single robot , 2001, Discret. Appl. Math..

[2]  G. Steiner,et al.  Level Schedules for Mixed-Model, Just-in-Time Processes , 1993 .

[3]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

[5]  Christos H. Papadimitriou,et al.  The Traveling Salesman Problem with Many Visits to Few Cities , 1984, SIAM J. Comput..

[6]  Marc E. Posner,et al.  Parallel machine scheduling with high multiplicity , 2001, Math. Program..

[7]  N. Braunera,et al.  The maximum deviation just-intime scheduling problem , 2003 .

[8]  Yves Crama,et al.  The maximum deviation just-in-time scheduling problem , 2004, Discret. Appl. Math..

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

[10]  Francis Sourd,et al.  Scheduling chains on a single machine with non-negative time lags , 2003, Math. Methods Oper. Res..

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

[12]  Gerd Finke,et al.  Complexity of One-Cycle Robotic Flow-Shops , 2003, J. Sched..

[13]  S. Sethi,et al.  A Note on "Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems" , 1991 .

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

[15]  A. Grigoriev,et al.  High multiplicity scheduling problems , 2003 .

[16]  M. E. Dyer,et al.  The Complexity of Vertex Enumeration Methods , 1983, Math. Oper. Res..

[17]  Wieslaw Kubiak,et al.  Optimal just-in-time schedules for flexible transfer lines , 1994 .

[18]  Eugene L. Lawler,et al.  Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..

[19]  Frits C. R. Spieksma,et al.  A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths , 2001, Math. Oper. Res..

[20]  Michael Rothkopf,et al.  Letter to the Editor - The Traveling Salesman Problem: On the Reduction of Certain Large Problems to Smaller Ones , 1966, Operational Research.

[21]  Randeep Bhatia,et al.  Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.

[22]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[23]  J. Miltenberg,et al.  Level schedules for mixed-model assembly lines in just-in-time production systems , 1989 .

[24]  Alexander Grigoriev,et al.  On the complexity of high multiplicity scheduling problems , 2001 .

[25]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

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

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