The evolution of schematic representations of flow shop scheduling problems

The schematic representation of schedules has been a useful tool for researchers; in this paper, we review existing network-based schematics for flow shop models. We also propose new schematics for flow shops with blocking, synchronous transfers, no-wait processing, no-idle time and limited buffer space. Using schematics, we explain some of the past findings and present new results. We also explain flow shop anomalies/paradoxes. Finally, we propose schematics for four flow shop models using the concept of string analog.

[1]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

[2]  Jerzy Kamburowski,et al.  On no-wait and no-idle flow shops with makespan criterion , 2007, Eur. J. Oper. Res..

[3]  D. Pohoryles,et al.  Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[4]  Horst A. Eiselt,et al.  Decision analysis, location models, and scheduling problems , 2003 .

[5]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[6]  Frits C. R. Spieksma,et al.  The no-wait flow-shop paradox , 2005, Oper. Res. Lett..

[7]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[8]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[9]  S. S. Panwalkar,et al.  Flowshop sequencing problem with ordered processing time matrices: A general case , 1976 .

[10]  I. Hamilton Emmons,et al.  Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications , 2012 .

[11]  Jeffrey W. Herrmann,et al.  The Perspectives of Taylor, Gantt, and Johnson: How to Improve Production Scheduling , 2010 .

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

[13]  William L. Maxwell,et al.  The Role of Work-in-Process Inventory in Serial Production Lines , 1988, Oper. Res..

[14]  Subhash C. Sarin,et al.  A review of lot streaming , 2013 .

[15]  Orsolya Bokor,et al.  APPLICATION OF EVALUATION LINES IN THE ANALYSIS OF TIME-TYPE DATA OF PROJECT PLANS , 2011 .

[16]  Czesław Smutnicki,et al.  A two-machine permutation flow shop scheduling problem with buffers , 1998 .

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

[18]  Jerzy Kamburowski,et al.  More on three-machine no-idle flow shops , 2004, Comput. Ind. Eng..

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

[20]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[21]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[22]  J W Fondahl,et al.  A non-computer approach to the critical path method , 1962 .

[23]  George J. Minty.  Letter to the Editor—A Variant on the Shortest-Route Problem , 1957 .

[24]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[25]  Jaideep Motwani,et al.  Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994 , 1997 .

[26]  George Steiner,et al.  Approximation methods for discrete lot streaming in flow shops , 1997, Oper. Res. Lett..

[27]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

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

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

[30]  Huan Neng Chiu,et al.  A comprehensive review of lot streaming , 2005 .

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

[32]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

[33]  Jens Kuhpfahl.  Job Shop Scheduling – Formulation and Modeling , 2016 .

[34]  Mehmet Mutlu Yenisey,et al.  Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends , 2014 .

[35]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

[36]  Sigrid Knust,et al.  Complexity results for flow shop problems with synchronous movement , 2015, Eur. J. Oper. Res..

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

[38]  James M. Wilson,et al.  Gantt charts: A centenary appreciation , 2003, Eur. J. Oper. Res..

[39]  Jatinder N. D. Gupta,et al.  A comprehensive review of flowshop group scheduling literature , 2016, Comput. Oper. Res..

[40]  Rubén Ruiz,et al.  A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..

[41]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[42]  Tamás Kis,et al.  A review of exact solution methods for the non-preemptive multiprocessor flowshop problem , 2005, Eur. J. Oper. Res..

[43]  Eugeniusz Nowicki,et al.  The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..

[44]  Victor Fernandez-Viagas,et al.  A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation , 2017, Eur. J. Oper. Res..

[45]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[46]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[47]  S. S. Panwalkar,et al.  Scheduling of a Two-machine Flowshop with Travel Time Between Machines , 1991 .

[48]  Helman I. Stern,et al.  Scheduling Parts in a Combined Production-transportation Work Cell , 1990 .

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