Two-stage flow-shop scheduling problem with non-identical second stage assembly machines

This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear programming model of this problem is defined, and for it being NP-hard, a hybrid SA heuristic is proposed. The heuristic is proved to solve the problem in reduced time with negligible error. To validate the proposed method, a real-life example is presented and solved in which the efficiency of the proposed heuristic is shown.

[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]  Ali Tozkapan,et al.  A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem , 2003, Comput. Oper. Res..

[3]  Jatinder N. D. Gupta,et al.  Genetic algorithms for the two-stage bicriteria flowshop problem , 1996 .

[4]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..

[5]  Dong-Ho Lee,et al.  Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops , 2009, Comput. Ind. Eng..

[6]  C. Sung,et al.  Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint , 2009 .

[7]  N. Javadian,et al.  Solving assembly flowshop scheduling problem with parallel machines using Variable Neighborhood Search , 2009, 2009 International Conference on Computers & Industrial Engineering.

[8]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

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

[10]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[11]  Fawaz S. Al-Anzi,et al.  The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time , 2008 .

[12]  Fawaz S. Al-Anzi,et al.  A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application , 2006, Comput. Oper. Res..

[13]  Fawaz S. Al-Anzi,et al.  The two-stage assembly scheduling problem to minimize total completion time with setup times , 2009, Comput. Oper. Res..

[14]  Jatinder N. D. Gupta,et al.  Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..

[15]  Dong-Ho Lee,et al.  Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates , 2009 .

[16]  Yan Zhang,et al.  The production scheduling problem in a multi-page invoice printing system , 2010, Comput. Oper. Res..

[17]  Christos Koulamas,et al.  A note on makespan minimization in two-stage flexible flow shops with uniform machines , 2006, Eur. J. Oper. Res..

[18]  Bertrand M. T. Lin,et al.  Scheduling in an assembly-type production chain with batch transfer , 2007 .

[19]  Fariborz Jolai,et al.  Flow shop scheduling with two batch processing machines and nonidentical job sizes , 2009 .

[20]  Ali Allahverdi,et al.  Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan , 2009, Comput. Oper. Res..

[21]  Reza Tavakkoli-Moghaddam,et al.  Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times , 2010 .

[22]  Mostafa Zandieh,et al.  Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop , 2010, Adv. Eng. Softw..

[23]  Andrew Kusiak,et al.  Scheduling manufacturing systems in an agile environment , 2001 .

[24]  C. Potts,et al.  A branch and bound algorithm for the two-stage assembly scheduling problem , 1997 .

[25]  Christos Koulamas,et al.  The three-stage assembly flowshop scheduling problem , 2001, Comput. Oper. Res..