An efficient exact algorithm for general single-machine scheduling with machine idle time

In this paper we propose an exact algorithm for the general single-machine scheduling problem where machine idle time is permitted. The algorithm is an extension of the authorspsila previous algorithm for the problem without machine idle time, which is based on the SSDP (successive sublimation dynamic programming) method. In this algorithm a lower bound is computed by applying dynamic programming to a Lagrangian relaxation of the original problem and then it is successively improved by imposing additional constraints on the relaxation until the gap between lower and upper bounds diminishes. Unnecessary dynamic programming states are eliminated in the course of the algorithm to reduce both computational efforts and memory usage. Experimental results show that the proposed algorithm can solve 200 jobs instances of the single-machine total weighted earliness-tardiness problem.

[1]  Leyuan Shi,et al.  New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem , 2008, IEEE Transactions on Automation Science and Engineering.

[2]  Han Hoogeveen,et al.  A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time , 1996, INFORMS J. Comput..

[3]  Safia Kedad-Sidhoum,et al.  A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem , 2008, J. Sched..

[4]  Shunji Tanaka,et al.  6A2 A BRANCH-AND-BOUND ALGORITHM BASED ON LARGRANGIAN RELAXATION FOR SINGLE-MACHINE SCHEDULING(Technical session 6A: Machine and shop scheduling 1) , 2006 .

[5]  T. Ibaraki,et al.  A dynamic programming method for single machine scheduling , 1994 .

[6]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[7]  Francis Sourd,et al.  Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints , 2006, Oper. Res. Lett..

[8]  Shunji Tanaka,et al.  An Exact Algorithm for Single-Machine Scheduling without Idle Time , 2007 .

[9]  Pei-Chann Chang.  A branch and bound approach for single machine scheduling with earliness and tardiness penalties , 1999 .

[10]  Roberto Tadei,et al.  An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem , 2004, Oper. Res. Lett..

[11]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[12]  Shunji Tanaka,et al.  An exact algorithm for single-machine scheduling without machine idle time , 2009, J. Sched..

[13]  Safia Kedad-Sidhoum,et al.  The One-Machine Problem with Earliness and Tardiness Penalties , 2003, J. Sched..

[14]  Candace Arai Yano,et al.  Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due-dates , 1994 .

[15]  Kerem Bülbül,et al.  Preemption in single machine earliness/tardiness scheduling , 2007 .

[16]  Francis Sourd,et al.  Optimal timing of a sequence of tasks with general completion costs , 2005, Eur. J. Oper. Res..

[17]  Francis Sourd.  A reinforced Lagrangean relaxation for non-preemptive single machine problem , 2006 .

[18]  茨木 俊秀,et al.  Enumerative approaches to combinatorial optimization , 1987 .

[19]  Ronald D. Armstrong,et al.  A branch and bound procedure to minimize mean absolute lateness on a single processor , 1996, Comput. Oper. Res..

[20]  John J. Kanet,et al.  Single-machine scheduling with early and tardy completion costs , 1993 .

[21]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[22]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[23]  Candace Arai Yano,et al.  Algorithms for a class of single-machine weighted tardiness and earliness problems , 1991 .