High-multiplicity cyclic job shop scheduling

We consider the High-Multiplicity Cyclic Job Shop Scheduling Problem. There are two objectives of interest: the cycle time and the flow time. We give several approximation algorithms after showing that a very restricted case is APX-hard.

[1]  Robert J. Wittrock,et al.  Scheduling Algorithms for Flexible Flow Lines , 1985, IBM J. Res. Dev..

[2]  Aravind Srinivasan,et al.  Better approximation guarantees for job-shop scheduling , 1997, SODA '97.

[3]  Martin Middendorf,et al.  On scheduling cycle shops: classification, complexity and approximation , 2002 .

[4]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[5]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[6]  Robin Roundy.  Cyclic Schedules for Job Shops with Identical Jobs , 1992, Math. Oper. Res..

[7]  Tae-Eog Lee,et al.  The complexity of cyclic shop scheduling problems , 2002 .

[8]  András Sebö,et al.  Paintshop, odd cycles and necklace splitting , 2009, Discret. Appl. Math..

[9]  Uri Zwick,et al.  MAX CUT in cubic graphs , 2002, SODA '02.

[10]  Stephen C. Graves,et al.  Scheduling of re-entrant flow shops , 1983 .

[11]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[12]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[13]  Vadim G. Timkovsky.  Cycle Shop Scheduling , 2004, Handbook of Scheduling.

[14]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

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

[16]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[17]  Nikhil Bansal,et al.  Job shop scheduling with unit processing times , 2005, SODA '05.

[18]  Marek Karpinski,et al.  Improved approximation of Max-Cut on graphs of bounded degree , 2002, J. Algorithms.

[19]  S. T. Mccormick,et al.  Some complexity results in cyclic scheduling , 1994 .

[20]  S. Akers.  Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .

[21]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .