Optimal algorithm for a two-machine flowshop scheduling problem with release dates and blocking constraints

ABSTRACT This work focuses on the scheduling of a set of jobs with different release dates in a two-machine flowshop, where the blocking constraint is considered to minimize the sum of completion times. First, we provide the assignment and positional variable formulation for the problem under consideration and some mathematical models for particular cases of our problem. Subsequently, we derive four lower bounds based on linear relaxations. According to our formulations, we solve the studied problem exactly to provide optimal solutions. Computational experiments performed on large classes of instances show the effectiveness of the developed approaches.

[1]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[2]  Talel Ladhari,et al.  A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates , 2017, Operational Research.

[3]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[4]  Srikanth K. Iyer,et al.  Improved genetic algorithm for the permutation flowshop scheduling problem , 2004, Comput. Oper. Res..

[5]  F. Tseng,et al.  The M × N Flowshop Problem with Separable, Sequence-independent Setup Times , 2006 .

[6]  R. Bellman,et al.  Some Combinatorial Problems Arising in the Theory of Multi-Stage Processes , 1954 .

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

[8]  Zheng-Yun Zhuang,et al.  Solving an outpatient nurse scheduling problem by binary goal programming , 2014 .

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

[10]  Tadeusz Sawik,et al.  Scheduling flexible flow lines with no in-process buffers , 1995 .

[11]  Mehdi Mrad,et al.  Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates , 2019, Int. Trans. Oper. Res..

[12]  Zheng-Yun Zhuang,et al.  Deciding product mix based on time-driven activity-based costing by mixed integer programming , 2017, J. Intell. Manuf..

[13]  Richard Bellman,et al.  Mathematical Aspects Of Scheduling And Applications , 1982 .

[14]  Yong Wu,et al.  Sequencing dual-spreader crane operations: Mathematical formulation and heuristic algorithm , 2017, Eur. J. Oper. Res..

[15]  Mohamed Haouari,et al.  MIP models for minimizing total tardiness in a two-machine flow shop , 2013, J. Oper. Res. Soc..

[16]  Talel Ladhari,et al.  Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop , 2009 .

[17]  Fariborz Jolai,et al.  A single-machine scheduling problem with multiple unavailability constraints: A mathematical model and an enhanced variable neighborhood search approach , 2017, J. Comput. Des. Eng..

[18]  Zbigniew Michalewicz,et al.  Advances in Metaheuristics for Hard Optimization , 2008, Advances in Metaheuristics for Hard Optimization.

[19]  Kun Yuan,et al.  Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking , 2009, 2009 IEEE Conference on Emerging Technologies & Factory Automation.

[20]  J. Carlier,et al.  Two branch and bound algorithms for the permutation flow shop problem , 1996 .

[21]  Liang Zhang,et al.  An effective hybrid genetic algorithm for flow shop scheduling with limited buffers , 2006, Comput. Oper. Res..

[22]  Yazid Mati,et al.  Complexity of flowshop scheduling problems with a new blocking constraint , 2003, Eur. J. Oper. Res..

[23]  Mehdi Mrad,et al.  A new lower bound for minimising the total completion time in a two-machine flow shop under release dates , 2013, 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO).

[24]  Ahmet B. Keha,et al.  Mixed integer programming formulations for single machine scheduling problems , 2009, Comput. Ind. Eng..

[25]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .