A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem

This paper deals with the one-machine dynamic total completion time scheduling problem. This problem is known to be NP-hard in the strong sense. A polynomial time heuristic algorithm is proposed which applies the recently introduced Recovering Beam Search (RBS) approach. The algorithm is based on a beam search procedure with unitary beam width and includes a recovering subroutine that allows to overcome wrong decisions taken at higher levels of the beam search tree. It is shown that the total number of considered nodes is bounded by n where n is the jobsize. The proposed algorithm is able to solve in very short CPU time problems with up to 500 jobs outperforming the best state of the art heuristics.

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

[2]  Colin R. Reeves,et al.  Heuristics for scheduling a single machine subject to unequal job release times , 1995 .

[3]  Reha Uzsoy,et al.  Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates , 1997, Ann. Oper. Res..

[4]  Lucio Bianco,et al.  Scheduling of a single machine to minimize total weighted completion time subject to release dates , 1982 .

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

[6]  Jiyin Liu,et al.  Effective heuristics for the single machine sequencing problem with ready times , 1991 .

[7]  Jitender S. Deogun.  On Scheduling with Ready Times to Minimize Mean Flow Time , 1983, Comput. J..

[8]  C. N. Potts,et al.  Scheduling with release dates on a single machine to minimize total weighted completion time , 1992, Discret. Appl. Math..

[9]  Chengbin Chu.  A branch‐and‐bound algorithm to minimize total flow time with unequal release dates , 1992 .

[10]  Roberto Tadei,et al.  A hybrid polynomial heuristic framework for combinatorial optimization problems , 2000 .

[11]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[12]  Chengbin Chu.  Efficient heuristics to minimize total flow time with release dates , 1992, Oper. Res. Lett..

[13]  Ramesh Chandra.  On n/1/F̄ dynamic deterministic problems , 1979 .

[14]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[15]  Reha Uzsoy,et al.  Single-machine scheduling with dynamic arrivals : Decomposition results and an improved algorithm , 1996 .

[16]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[17]  Reha Uzsoy,et al.  An iterative heuristic for the single machine dynamic total completion time scheduling problem , 1996, Comput. Oper. Res..

[18]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[19]  Gerhard J. Woeginger,et al.  Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine , 1999, SIAM J. Comput..

[20]  Jitender S. Deogun,et al.  Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time , 1981, SIAM J. Comput..