A new lower bound for minimising the total completion time in a two-machine flow shop under release dates

In this paper, we describe a mixed integer linear programming (MILP) formulation used to model the two-machine flow shop scheduling problem subject to release dates. This MILP formulation is based on the Positional and Assignment Variables(PAVF). The results of the linear relaxation bound derived from the later mathematical formulation shows the performance of this new bound compared with the best known lower bound recently presented for the studied problem.

[1]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

[2]  Mohamed Ali Rakrouki,et al.  A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates , 2009, 2009 International Conference on Computers & Industrial Engineering.

[3]  Mohamed Haouari,et al.  An assignment-based lower bound for a class of two-machine flow shop problems , 2013, Comput. Oper. Res..

[4]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[5]  Han Hoogeveen,et al.  Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time , 1994, Oper. Res. Lett..

[6]  Can Akkan,et al.  The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm , 2004, Eur. J. Oper. Res..

[7]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

[8]  Han Hoogeveen,et al.  Lower bounds for minimizing total completion time in a two-machine flow shop , 2006, J. Sched..

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

[10]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[11]  Uttarayan Bagchi,et al.  Lower bounds for single‐machine scheduling problems , 1990 .

[12]  Mohamed Haouari,et al.  A computational study of the permutation flow shop problem based on a tight lower bound , 2005, Comput. Oper. Res..