Minimizing maximum lateness in a flow shop subject to release dates

We consider the problem of minimizing the maximum lateness in a m-machine flow shop subject to release dates. The objective of this paper is to develop a new branch-and-bound algorithm to solve exactly this strongly NP-hard problem. The proposed branch-and-bound algorithm encompasses several features including a procedure for adjusting heads and tails, heuristics, and a lower bounding procedure, which is based on the exact solution of the two-machine flow shop problem with time lags, ready times, and delivery times. Extensive computational experiments show that instances with up to 6000 operations can be solved exactly in a moderate CPU time.

[1]  Ali Allahverdi,et al.  No-wait flowshops with bicriteria of makespan and maximum lateness , 2004, Eur. J. Oper. Res..

[2]  Fawaz S. Al-Anzi,et al.  Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications , 2002, Comput. Oper. Res..

[3]  Paul Stephenson,et al.  A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times , 2001, Eur. J. Oper. Res..

[4]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

[5]  Leslie A. Hall,et al.  A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem , 1994, Math. Oper. Res..

[6]  Mikhail Y. Kovalyov,et al.  A polynomial approximation scheme for problem F2/rj/Cmax , 1997, Oper. Res. Lett..

[7]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

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

[9]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[10]  Talel Ladhari,et al.  Minimising maximum lateness in a two-machine flowshop , 2000, J. Oper. Res. Soc..

[11]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

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

[13]  Chris N. Potts,et al.  An adaptive branching rule for the permutation flow-shop problem , 1980 .

[14]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[15]  Paul Stephenson,et al.  Fast algorithms to minimize the makespan or maximum lateness in the two‐machine flow shop with release times , 2002 .

[16]  C. N. Potts.  Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates , 1985, Math. Oper. Res..

[17]  Mohamed Haouari,et al.  Minimizing makespan on parallel machines subject to release dates and delivery times , 2002 .

[18]  Fawaz S. Al-Anzi,et al.  Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm , 2006 .