A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming

This paper presents a hybrid genetic algorithm/mathematical programming heuristic for the n-job, m-machine flowshop problems with lot streaming. The number of sublots for each job and the size of sublots are directly addressed by the heuristic and setups may be sequence-dependent. A new aspect of the problem, the interleaving of sublots from different jobs in the processing sequence, is developed and addressed. Computational results from 12 randomly generated test sets of 24 problems each are presented.

[1]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[2]  Jose A. Ventura,et al.  An application of genetic algorithms to lot-streaming flow shop scheduling , 2002 .

[3]  Iie Amar Dev Amar Senior Member,et al.  Simulated Versus Real Life Data in Testing the Efficiency of Scheduling Algorithms , 1986 .

[4]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[5]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[6]  Arben Asllani,et al.  Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming , 2004 .

[7]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[8]  Jatinder N. D. Gupta,et al.  An empirical analysis of integer programming formulations for the permutation flowshop , 2004 .

[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]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[11]  Alper Sen,et al.  Optimal streaming of a single job in a two-stage flow shop , 1998, Eur. J. Oper. Res..

[12]  Kenneth R. Baker,et al.  Basic Techniques for Lot Streaming , 1993, Oper. Res..

[13]  C. Sriskandarajah,et al.  Lot streaming and scheduling multiple products in two-machine no-wait flowshops , 1999 .

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

[15]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[16]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[17]  Christian Prins,et al.  Competitive genetic algorithms for the open-shop scheduling problem , 2000, Math. Methods Oper. Res..

[18]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[19]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[20]  Faizul Huq,et al.  Employee scheduling and makespan minimization in a flow shop with multi-processor work stations: a case study , 2004 .

[21]  Chris N. Potts,et al.  Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs , 1996 .