A branch and bound algorithm to minimize the total tardiness for m

Abstract The m -machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-based lower bound and a dominance test for pruning nodes. We undertake a numerical study that evaluates our algorithm and compares it with the best alternative existing algorithm. Extensive computational experiments indicate that our algorithm performs better and can handle test problems with n  ⩽ 20.

[1]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems , 2002 .

[2]  Jatinder N. D. Gupta,et al.  The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..

[3]  Meral Azizoglu,et al.  An efficient algorithm for the single machine tardiness problem , 1994 .

[4]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[5]  Yuji Ijiri,et al.  Creative and Innovative Approaches to the Science of Management , 1988 .

[6]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

[7]  A. Volgenant,et al.  Improved heuristics for the n-job single-machine weighted tardiness problem , 1999, Comput. Oper. Res..

[8]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[9]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[10]  R. M. Russell,et al.  A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness , 1992 .

[11]  Yasuhiro Hirakawa.  A quick optimal algorithm for sequencing on one machine to minimize total tardiness , 1999 .

[12]  Wlodzimierz Szwarc,et al.  Decomposition of the single machine total tardiness problem , 1996, Oper. Res. Lett..

[13]  Randolph M. Russell,et al.  Evaluation of leading heuristics for the single machine tardiness problem , 1997 .

[14]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[15]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[16]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[17]  Ihsan Sabuncuoglu,et al.  An Efficient Algorithm for the Single Machine Total Tardiness Problem , 2001 .

[18]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[19]  Wlodzimierz Szwarc,et al.  Solution of the single machine total tardiness problem , 1999 .

[20]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[21]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..