Earliness-tardiness scheduling with setup considerations

The one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties is addressed. A time-indexed formulation of the problem is presented as well as different relaxations that give lower bounds of the problem. Then, a branch-and-bound procedure based on one of these lower bounds is presented. The efficiency of this algorithm also relies on new dominance rules and on a heuristic to derive good feasible schedules. Computational tests are finally presented.

[1]  Ross J. W. James,et al.  A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem , 1997 .

[2]  Jacob Wijngaard,et al.  Minimizing weighted total earliness, total tardiness and setup costs , 1995 .

[3]  Francis Sourd.  Scheduling a sequence of tasks with general completion costs , 2002 .

[4]  C. Lemaréchal.  Nondifferentiable optimization , 1989 .

[5]  A. Gupta,et al.  A GENETIC ALGORITHM FOR SCHEDULING JOB FAMILIES ON A SINGLE MACHINE WITH ARBITRARY EARLINESS/TARDINESS PENALTIES AND AN UNRESTRICTED COMMON DUE DATE , 1998 .

[6]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

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

[8]  Mansooreh Mollaghasemi,et al.  A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time , 2004, Comput. Oper. Res..

[9]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[10]  Benjamin P.-C. Yen,et al.  Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties , 2002, Eur. J. Oper. Res..

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

[12]  Philippe Baptiste,et al.  Tight LP bounds for resource constrained project scheduling , 2004, OR Spectr..

[13]  R.W.H. Sargent,et al.  The optimal operation of mixed production facilities : extensions and improvements , 1998 .

[14]  J. Blackstone,et al.  Minimizing Weighted Absolute Deviation in Single Machine Scheduling , 1987 .

[15]  Zhiwei Zhu,et al.  Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach , 2000 .

[16]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[17]  Wlodzimierz Szwarc,et al.  Optimal timing schedules in earliness-tardiness single machine sequencing , 1995 .

[18]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

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

[20]  Laurent Péridy,et al.  Using short-term memory to minimize the weighted number of late jobs on a single machine , 2003, Eur. J. Oper. Res..

[21]  Nagraj Balakrishnan,et al.  Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..

[22]  Francis Sourd,et al.  The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions , 2004, INFORMS J. Comput..

[23]  Jose A. Ventura,et al.  Single machine scheduling with symmetric earliness and tardiness penalties , 2003, Eur. J. Oper. Res..

[24]  Zhi-Long Chen.  Scheduling with batch setup times and earliness-tardiness penalties , 1997 .

[25]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

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

[27]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[28]  S. T. Webster,et al.  The complexity of scheduling job families about a common due date , 1997, Oper. Res. Lett..

[29]  Francis Sourd,et al.  PERT scheduling with convex cost functions , 2003, Theor. Comput. Sci..

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

[31]  Francis Sourd,et al.  Scheduling with convex cost functions , 2000 .

[32]  Meral Azizoglu,et al.  Scheduling job families about an unrestricted common due date on a single machine , 1997 .