A two-stage hybrid flow shop problem with dedicated machine and release date

Abstract This paper presents a mathematical model, three heuristics and two lower bounds in order to solve the hybrid flow shop scheduling problem with parallel machines at the first stage and two dedicated machines at the second stage. Each job is subject to a release date at stage one. The objective is to minimize the makespan.

[1]  Ouajdi Korbaa,et al.  Heuristics for the Hybrid Flow Shop Scheduling Problem with Parallel Machines at the First Stage and Two Dedicated Machines at the Second Stage , 2017, ISDA.

[2]  Jaehwan Yang,et al.  Hybrid Flow Shop with Parallel Machines at the First Stage and Dedicated Machines at the Second Stage , 2015 .

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

[4]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[5]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[6]  Jaehwan Yang.  Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage , 2015, Comput. Oper. Res..

[7]  Xingsheng Gu,et al.  An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems , 2015, Neurocomputing.

[8]  Jacques Carlier,et al.  Scheduling jobs with release dates and tails on identical machines to minimize the makespan , 1987 .

[9]  Mohamed Haouari,et al.  Optimal Scheduling of a Two-stage Hybrid Flow Shop , 2006, Math. Methods Oper. Res..

[10]  Bertrand M. T. Lin.  Two-stage flow shop scheduling with dedicated machines , 2015 .

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