Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem

Lot streaming is the technique of splitting a given job into sublots to allow the overlapping of successive operations in multi-stage manufacturing systems thereby reducing production makespan. Several research articles appeared in literature to solve this problem and most of these studies are limited to pure flowshop environments where there is only a single machine in each stage. On the other hand, because of the applicability of hybrid flowshops in different manufacturing settings, the scheduling of these types of shops is also extensively studied by several authors. However, the issue of lot streaming in hybrid flowshop environment is not well studied. In this paper, we aim to contribute in bridging the gap between the research efforts in flowshop lot streaming and hybrid flowshop scheduling. We propose a mathematical model and a genetic algorithm for the lot streaming problem of several jobs in multi-stage flowshops where at each stage there are unrelated parallel machines. The jobs may skip some of the stages, and therefore, the considered system is a complex generalized flowshop. The proposed genetic algorithm is executed on both sequential and parallel computing platforms. Numerical examples showed that the parallel implementation greatly improved the computational performance of the developed heuristic.

[1]  N. Jawahar,et al.  Evolutionary algorithms for scheduling m-machine flow shop with lot streaming , 2008 .

[2]  Huan Neng Chiu,et al.  Lot streaming models with a limited number of capacitated transporters in multistage batch production systems , 2004, Comput. Oper. Res..

[3]  S. C. Liu A heuristic method for discrete lot streaming with variable sublots in a flow shop , 2003 .

[4]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[5]  Khim Ling Sim,et al.  Time‐based competition , 1999 .

[6]  Chelliah Sriskandarajah,et al.  Scheduling and Lot Streaming in Flowshops with No-Wait in Process , 2003, J. Sched..

[7]  Ceyda Oguz,et al.  Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion , 2007 .

[8]  S. Reiter A System for Managing Job-Shop Production , 1966 .

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

[10]  Chris N. Potts,et al.  Flow shop scheduling with lot streaming , 1989 .

[11]  Clarence H. Martin,et al.  A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming , 2009 .

[12]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

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

[14]  Hua Xuan,et al.  A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time , 2006, Comput. Oper. Res..

[15]  Richard L. Shell,et al.  Time Based Manufacturing , 1993 .

[16]  Kenneth R. Baker,et al.  Lot streaming in the two-machine flow shop with setup times , 1995, Ann. Oper. Res..

[17]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

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

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

[20]  Wei Zhang,et al.  Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops , 2005 .

[21]  Mingyuan Chen,et al.  A parallel genetic algorithm for dynamic cell formation in cellular manufacturing systems , 2008 .

[22]  T. P. Bagchi,et al.  Lot streaming and scheduling heuristics for m -machine no-wait flowshops , 2000 .

[23]  Jiang Chen,et al.  Lot streaming with attached setups in three-machine flow shops , 1997 .

[24]  Kenneth R. Baker,et al.  A comparative study of lot streaming procedures , 1993 .

[25]  Martin Feldmann,et al.  Lot streaming with variable sublots: an integer programming formulation , 2006, J. Oper. Res. Soc..

[26]  Wenxin Liu,et al.  A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment , 2005, J. Intell. Manuf..

[27]  Ceyda Oguz,et al.  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks , 2005, J. Sched..

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

[29]  Shih-Wei Lin,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach , 2006 .

[30]  Paveena Chaovalitwongse,et al.  Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2008 .

[31]  R. G. Vickson,et al.  Two- and three-machine flow shop scheduling problems with equal sized transfer batches , 1992 .

[32]  Wendong Xiao,et al.  Hybrid flow shop scheduling using genetic algorithms , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).

[33]  Michael Masin,et al.  Multi-objective lot splitting for a single product m-machine flowshop line , 2004 .

[34]  Jean-Charles Billaut,et al.  Production , Manufacturing and Logistics A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation , 2004 .

[35]  Ching-Jong Liao,et al.  A discrete particle swarm optimization for lot-streaming flowshop scheduling problem , 2008, Eur. J. Oper. Res..

[36]  Chris N. Potts,et al.  Lot streaming in three-stage production processes , 1994 .

[37]  D. Biskup,et al.  Lot streaming in a multiple product permutation flow shop with intermingling , 2008 .

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

[39]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.