New index priority rules for no-wait flow shops

Abstract We derive an index priority rule for an m-machine no-wait flow shop with the minimum makespan objective and specially-structured job processing times. Our rule generalizes the previously known rules for two special cases of the problem. We also derive an index priority rule for a two-machine no-wait flow shop with the minimum weighted total job completion time objective when all jobs have the same processing time on the first machine. We then show that additional index priority rules can be derived for the latter problem with other scheduling objectives. Finally, we discuss extensions to flow shops with blocking and no-wait job shops and open shops.

[1]  Han Hoogeveen,et al.  Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases , 1999, Math. Oper. Res..

[2]  Ali Allahverdi,et al.  A survey of scheduling problems with no-wait in process , 2016, Eur. J. Oper. Res..

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

[4]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[5]  Shigeji Miyazaki,et al.  ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING , 1980 .

[6]  Chris N. Potts,et al.  Fifty years of scheduling: a survey of milestones , 2009, J. Oper. Res. Soc..

[7]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[8]  Christos Koulamas,et al.  The proportionate two-machine no-wait job shop scheduling problem , 2016, Eur. J. Oper. Res..

[9]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

[10]  Christos Koulamas,et al.  A note on the optimality of index priority rules for search and sequencing problems , 2011 .

[11]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[12]  Michael H. Rothkopf,et al.  Technical Note - There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs , 1984, Oper. Res..

[13]  S. L. Velde.  Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

[14]  R. A. Dudek,et al.  Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .

[15]  Fennell Burns,et al.  Technical Note - Johnson's Three-Machine Flow-Shop Conjecture , 1976, Oper. Res..

[16]  René van Dal,et al.  Solvable Cases of the No-Wait Flow-Shop Scheduling Problem , 1991 .

[17]  S. S. Panwalkar,et al.  Ordered Flow Shop Problems with no In-Process Waiting: Further Results , 1980 .

[18]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[19]  Christos Koulamas,et al.  On index priority sequencing rules for scheduling with time-dependent job processing times , 2013, Oper. Res. Lett..

[20]  R. K. Arora,et al.  Scheduling in a Semi-Ordered Flow-shop Without Intermediate Queues , 1980 .

[21]  Meral Azizoglu,et al.  Flow shop-sequencing problem with synchronous transfers and makespan minimization , 2007 .

[22]  Chelliah Sriskandarajah,et al.  A review of TSP based approaches for flowshop scheduling , 2006, Eur. J. Oper. Res..

[23]  Francis Y. L. Chin,et al.  Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems , 1982, Math. Oper. Res..

[24]  Neta Amit,et al.  Openshop and flowshop scheduling to minimize sum of completion times , 1984, Comput. Oper. Res..

[25]  Christos Koulamas,et al.  The two-machine no-wait general and proportionate open shop makespan problem , 2014, Eur. J. Oper. Res..

[26]  Sven Axsäter.  On Scheduling in a Semi-Ordered Flow Shop without Intermediate Queues , 1982 .

[27]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[28]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[29]  Chelliah Sriskandarajah,et al.  Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..

[30]  S. S. Panwalkar,et al.  Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case , 1979 .

[31]  Han Hoogeveen,et al.  Minimizing total weighted completion time in a proportionate flow shop , 1998 .