Flow-shop scheduling for three serial stations with the last two duplicate

This paper addresses the problem of scheduling jobs for three serial stations with the last two duplicate, i.e., identical. The performance measure considered is the makespan, and a Branch and Bound and two heuristic procedures are proposed. Two dominance criteria are developed to produce the optimal schedule for the jobs sequenced so far. Extensive computational experiments reveal that the Genetic Algorithm can be used to obtain a group of effective solutions for any realistic size problem within small computation time.

[1]  I. Al-harkan.  On merging sequencing and scheduling theory with genetic algorithms to solve stochastic job shops , 1997 .

[2]  Stanley B. Gershwin,et al.  Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers , 1983, Oper. Res..

[3]  Ahmet Bolat,et al.  Sequencing jobs for an automated manufacturing module with buffer , 1997 .

[4]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

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

[7]  Jack R. Meredith,et al.  The managemant of operations: a conceptual emphasis , 1992 .

[8]  Ali Allahverdi,et al.  Algorithms for scheduling jobs on two serial duplicate stations , 1999 .

[9]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[10]  Randolph W. Hall,et al.  TANDEM TOLL BOOTHS FOR THE GOLDEN GATE BRIDGE , 1983 .

[11]  X. Chao,et al.  Operations scheduling with applications in manufacturing and services , 1999 .

[12]  Chris N. Potts,et al.  A New Heuristic for Three-Machine Flow Shop Scheduling , 1996, Oper. Res..

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  J. Carlier,et al.  Two branch and bound algorithms for the permutation flow shop problem , 1996 .

[15]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

[16]  Z. Binder,et al.  Management and control of production and logistics (MCPL '97) : a proceedings volume from the IFAC/IFIP conference, Campinas, SP, Brazil, 31 August-3 September 1997 , 1998 .

[17]  Ahmet Bolat,et al.  Algorithms for real-time scheduling of jobs on mixed model assembly lines , 1994, Comput. Oper. Res..

[18]  W. C. Ng.  Determining the optimal number of duplicated process tanks in a single-hoist circuit board production line , 1995 .

[19]  Robert R. Inman,et al.  SCHEDULING DUPLICATE SERIAL STATIONS IN TRANSFER LINES , 1994 .

[20]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

[21]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[22]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..

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