Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions

: For the past three decades or so the flexible flow shop (FFS) scheduling problem has attracted many researchers. Numerous research articles have been published on this topic. This study reviews research on the FFS scheduling problem from the past and the present. The solution approaches reviewed range from the optimum to heuristics and to artificial intelligence search techniques. I not only discuss the details from the selected methods and compare them, but also provide insights and suggestions for future research.

[1]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

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

[3]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

[4]  Shi-Chung Chang,et al.  Scheduling flexible flow shops with no setup effects , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[5]  Seetuarma L. Narastmhan,et al.  Scheduling in a two-stage manufacturing process , 1984 .

[6]  Michael Pinedo,et al.  BPSS: A Scheduling Support System for the Packaging Industry , 1993, Oper. Res..

[7]  Tadeusz Sawik,et al.  Scheduling flexible flow lines with no in-process buffers , 1995 .

[8]  J. Gupta,et al.  Scheduling a two-stage hybrid flowshop with separable setup and removal times , 1994 .

[9]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

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

[11]  Giuseppe Oriolo,et al.  Scheduling of Flexible Flow Lines in an Automobile Assembly Plant , 1997 .

[12]  Robert J. T. Morris,et al.  Heuristic methods for flexible flow line scheduling , 1987 .

[13]  Li Wang,et al.  A scheduling algorithm for flexible flow shop problem , 2002, Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No.02EX527).

[14]  Marie-Claude Portmann,et al.  Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..

[15]  Christos Koulamas,et al.  A note on weighted completion time minimization in a flexible flow shop , 2001, Oper. Res. Lett..

[16]  Jatinder N. D. Gupta,et al.  Heuristics for hybrid flow shops with controllable processing times and assignable due dates , 2002, Comput. Oper. Res..

[17]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[18]  T. Sawik.  An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers , 2002 .

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

[20]  Shi-Chung Chang,et al.  Scheduling flexible flow shops with sequence-dependent setup effects , 2000, IEEE Trans. Robotics Autom..

[21]  Seetharama L. Narasimhan,et al.  A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP , 1987 .

[22]  Tzung-Pei Hong,et al.  A heuristic Palmer-based fuzzy flexible flow-shop scheduling algorithm , 1999, FUZZ-IEEE'99. 1999 IEEE International Fuzzy Systems. Conference Proceedings (Cat. No.99CH36315).

[23]  John L. Hunsucker,et al.  Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment , 1994 .

[24]  D. Santos,et al.  Global lower bounds for flow shops with multiple processors , 1995 .

[25]  H. Wang,et al.  Design of efficient hybrid neural networks for flexible flow shop scheduling , 2003, Expert Syst. J. Knowl. Eng..

[26]  Shaukat A. Brah,et al.  Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..

[27]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[28]  John L. Hunsucker,et al.  An evaluation of sequencing heuristics in flow shops with multiple processors , 1996 .

[29]  Jatinder N. D. Gupta,et al.  Heuristic Algorithms for Multistage Flowshop Scheduling Problem , 1972 .

[30]  D. Chaudhuri,et al.  A multi-stage parallel-processor flowshop problem with minimum flowtime , 1992 .

[31]  Michael Pinedo,et al.  Heuristics for minimizing total weighted tardiness in flexible flow shops , 2000 .

[32]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[33]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[34]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[35]  Yoichi Miyake,et al.  Production scheduling system in the hybrid flow shop , 1993 .

[36]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[37]  Eugeniusz Nowicki,et al.  The flow shop with parallel machines: A tabu search approach , 1998, Eur. J. Oper. Res..

[38]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .

[39]  John J. Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities , 1999 .

[40]  Takashi Sekiguchi,et al.  CORBA-based design and development of distributed scheduling systems: an application to flexible flow shop scheduling systems , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[41]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[42]  Fong-Yuen Ding,et al.  Heuristics for scheduling flexible flow lines , 1994 .

[43]  Tzung-Pei Hong,et al.  A palmer-based continuous fuzzy flexible flow-shop scheduling algorithm , 2001, Soft Comput..

[44]  Chelliah Sriskandarajah,et al.  Some no-wait shops scheduling problems: Complexity aspect , 1986 .

[45]  V. JORGE LEON,et al.  An adaptable problem-space-based search method for flexible flow line scheduling , 1997 .

[46]  Chandrasekharan Rajendran,et al.  Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan , 1992 .

[47]  Michael J. Shaw,et al.  A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[48]  Tzung-Pei Hong,et al.  Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains , 2000, Information Sciences.

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

[50]  Panagiotis Kouvelis,et al.  Design of electronic assembly lines: An analytical framework and its application , 1999, Eur. J. Oper. Res..

[51]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .