Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates

This paper presents new elimination rules for the single machine problem with general earliness and tardiness penalties subject to release dates. These rules, based on a Lagrangian decomposition, allow to drastically reduce the execution windows of the jobs. We measure the efficiency of these properties by integrating them in a branch-and-bound. Tests show that instances with up to 70 jobs without release dates, and up to 40 jobs with release dates, can be optimally solved within 1000 seconds.

[1]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[2]  Jacques Carlier,et al.  Ordonnancements à contraintes disjonctives , 1978 .

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

[4]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

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

[6]  Francis Sourd,et al.  New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling , 2009, INFORMS J. Comput..

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

[8]  Safia Kedad-Sidhoum,et al.  Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates , 2008, Eur. J. Oper. Res..

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

[10]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[11]  Jae Young Choi,et al.  A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights , 1995, Comput. Oper. Res..

[12]  Meinolf Sellmann,et al.  Cp-based lagrangian relaxation for a multimedia application , 2001 .

[13]  Refael Hassin,et al.  Machine scheduling with earliness, tardiness and non-execution penalties , 2005, Comput. Oper. Res..

[14]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[15]  Meinolf Sellmann,et al.  Theoretical Foundations of CP-Based Lagrangian Relaxation , 2004, CP.

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

[17]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[18]  Shunji Tanaka,et al.  An efficient exact algorithm for general single-machine scheduling with machine idle time , 2008, 2008 IEEE International Conference on Automation Science and Engineering.

[19]  Ching-Fang Liaw,et al.  A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem , 1999, Comput. Oper. Res..

[20]  V. Sridharan,et al.  Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review , 2000, Oper. Res..

[21]  Francis Sourd,et al.  Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem , 2006, Eur. J. Oper. Res..

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

[23]  Joanna Józefowska,et al.  Minimizing the earliness-tardiness costs on a single machine , 2006, Comput. Oper. Res..

[24]  Milan Vlach,et al.  Scheduling with earliness and tardiness penalties , 1992 .

[25]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[26]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..

[27]  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..

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

[29]  Jacques Carlier,et al.  Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .

[30]  Francis Sourd,et al.  An improved earliness-tardiness timing algorithm , 2007, Comput. Oper. Res..

[31]  Shunji Tanaka,et al.  A branch-and-bound algorithm for the single-machine weighted earliness-tardiness scheduling problem with job independent weights , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).