Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach

This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The objective is to minimize the make-span, that is, the completion time of all the tasks in the last stage. This problem is of practical interest in the textile and process industries. A genetic algorithm (GA) is developed to solve the problem. The GA is tested against a lower bound from the literature as well as against heuristic rules on a test bed comprising 400 problems with up to 100 jobs, 10 stages, and with up to five processors on each stage. For small problems, solutions found by the GA are compared to optimal solutions, which are obtained by total enumeration. For larger problems, optimum solutions are estimated by a statistical prediction technique. Computational results show that the GA is both effective and efficient for the current problem. Test problems are provided in a web site at www.benchmark.ibu.edu.tr/mpt-hfsp.

[1]  Nikolay Tchernev,et al.  Generic simulation model for hybrid flow-shop , 1999 .

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

[3]  Michael Pinedo,et al.  Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

[4]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[5]  S. Iassinovski,et al.  An integrated production planning and scheduling system for hybrid flowshop organizations , 2001 .

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

[7]  Yves Pochet,et al.  A branch-and-bound algorithm for the hybrid flowshop , 2000 .

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

[9]  Zsolt Tuza,et al.  A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors , 1999, Parallel Comput..

[10]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

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

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

[13]  Ceyda Oğuz,et al.  A GENETIC ALGORITHM FOR FLOW-SHOP SCHEDULING PROBLEMS WITH MULTIPROCESSOR TASKS , 2002 .

[14]  Mohamed Haouari,et al.  Heuristic algorithms for the two-stage hybrid flowshop problem , 1997, Oper. Res. Lett..

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

[16]  Ceyda Oguz,et al.  Scheduling multiprocessor tasks in a two-stage flow-shop environment , 1997 .

[17]  Peter Brucker,et al.  Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems , 1996 .

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

[19]  Chung-Lun Li,et al.  Minimizing total completion time in two‐processor task systems with prespecified processor allocations , 1998 .

[20]  Reha Uzsoy,et al.  Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems , 2000, J. Heuristics.

[21]  Stelios H. Zanakis,et al.  A simulation study of some simple estimators for the three-parameter weibull distribution , 1979 .

[22]  Jianer Chen,et al.  General Multiprocessor Task Scheduling , 1999 .

[23]  Gupta J.N.D..  TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[24]  R. Fisher,et al.  Limiting forms of the frequency distribution of the largest or smallest member of a sample , 1928, Mathematical Proceedings of the Cambridge Philosophical Society.

[25]  T. C. Edwin Cheng,et al.  Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop , 2003, Eur. J. Oper. Res..

[26]  Ebbe G. Negenman,et al.  Local search algorithms for the multiprocessor flow shop scheduling problem , 2001, Eur. J. Oper. Res..

[27]  Reha Uzsoy,et al.  Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial , 2001, J. Heuristics.

[28]  Ronald L. Rardin,et al.  Using a hybrid of exact and genetic algorithms to design survivable networks , 2002, Comput. Oper. Res..

[29]  Paolo Dell'Olmo,et al.  Scheduling multiprocessor tasks for mean flow time criterion , 2000, Comput. Oper. Res..

[30]  Marin Golub,et al.  Scheduling Multiprocessor Tasks with Genetic Algorithms , 2019 .

[31]  Abdelhakim Artiba,et al.  Hybrid auto-adaptable simulated annealing based heuristic , 1999 .

[32]  Lucio Bianco,et al.  Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness , 1997, Discret. Appl. Math..

[33]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[34]  Ceyda Oguz,et al.  Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..

[35]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[36]  Maged M. Dessouky,et al.  Flowshop scheduling with identical jobs and uniform parallel machines , 1998, Eur. J. Oper. Res..

[37]  Chung-Yee Lee,et al.  Multiprocessor task scheduling to minimize the maximum tardiness and the total completion time , 2000, IEEE Trans. Robotics Autom..

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

[39]  P. S. Sundararaghavan,et al.  Minimizing makespan in parallel flowshops , 1997 .

[40]  J. N. D. Gupta,et al.  Minimizing tardy jobs in a two-stage hybrid flowshop , 1998 .

[41]  Elham Ghashghai.  Hybrid of exact and genetic algorithms for graph optimal problems with application to survivable network design , 1997 .

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