Dominance-based heuristics for one-machine total cost scheduling problems

We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time. We describe dominance rules for these criteria, as well as techniques for using these dominance rules to build heuristic solutions. We use them to improve certain well-known greedy heuristic algorithms from the literature. Finally, we introduce a Tabu Search method with a neighborhood based on our dominance rules. Experiments show the effectiveness of our techniques in obtaining very good solutions for all studied criteria.

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

[2]  M. Selim Akturk,et al.  Theory and Methodology a New Dominance Rule to Minimize Total Weighted Tardiness with Unequal Release Dates , 1998 .

[3]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

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

[5]  C. Chu,et al.  Some new efficient methods to solve the n/1/ri/ϵTi scheduling problem , 1992 .

[6]  Philippe Baptiste,et al.  A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates , 2004, Eur. J. Oper. Res..

[7]  W. Szwarc,et al.  Weighted Tardiness Single Machine Scheduling with Proportional Weights , 1993 .

[8]  Thomas E. Morton,et al.  Guided Forward Search in Tardiness Scheduling of Large One Machine Problems , 1995 .

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

[10]  李幼升,et al.  Ph , 1989 .

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

[12]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

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

[14]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[15]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

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

[17]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

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

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

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

[21]  M. Selim Akturk,et al.  An exact approach to minimizing total weighted tardiness with release dates , 2000 .

[22]  Xue Jinsong.  INTELLIGENT SCHEDULING SYSTEM OF FLEXIBLE MANUFACTURING CELL , 1991 .

[23]  Federico Della Croce,et al.  A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem , 2002, J. Oper. Res. Soc..

[24]  John J. Kanet,et al.  A DECISION THEORY APPROACH TO PRIORITY DISPATCHING FOR JOB SHOP SCHEDULING , 2009 .

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

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