Minimizing the weighted number of tardy jobs on a single machine with release dates

Abstract In this paper, we describe an exact algorithm to minimize the weighted number of tardy jobs on a single machine with release dates. The algorithm uses branch-and-bound; a surrogate relaxation resulting in a multiple-choice knapsack provides the bounds. Extensive computational experiments indicate the proposed exact algorithm solves either weighted or unweighted problems. It solves the hardest problems to date. Indeed, it solves all previously unsolved instances. Its run time is the shortest to date. Scope and purpose : In many industrial sectors, satisfying due dates is a critical issue. Thus, lateness related measures such as the weighted number of tardy jobs are relevant performance measures of schedules in these industries. Our paper studies minimizing the weighted number of tardy jobs on a single machine with release and due dates, and proposes a new exact algorithm. For both weighted and unweighted problems, the exact algorithm solves the largest problems to date.

[1]  Ruslan Sadykov.  A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem , 2004, CPAIOR.

[2]  L. B. J. M. Sturm.  A Simple Optimality Proof of Moore's Sequencing Algorithm , 1970 .

[3]  Martin Dyer,et al.  AN O(n) ALGORITHM FOR THE MULTIPLE-CHOICE , 2007 .

[4]  Guochun Tang.  A new branch and bound algorithm for minimizing the weighted number of tardy jobs , 1990 .

[5]  Stéphane Dauzère-Pérès,et al.  Minimizing late jobs in the general one machine scheduling problem , 1995 .

[6]  E. L. Lawler,et al.  Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property , 1994 .

[7]  L. V. Wassenhove,et al.  Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

[8]  Stéphane Dauzère-Pérès,et al.  An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling , 2004, J. Sched..

[9]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[10]  R. L. Bulfin,et al.  Minimizing the weighted number of tardy jobs on a single machine , 2003, Eur. J. Oper. Res..

[11]  Toshihide Ibaraki,et al.  A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..

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

[13]  Stéphane Dauzère-Pérès,et al.  Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine , 2003 .

[14]  Robert L. Bulfin,et al.  Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs , 1983 .

[15]  Philippe Baptiste,et al.  An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1999, Oper. Res. Lett..

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

[17]  E. L. Lawler,et al.  A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .

[18]  Philippe Baptiste,et al.  A branch and bound to minimize the number of late jobs on a single machine with release time constraints , 2003, Eur. J. Oper. Res..

[19]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[20]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[21]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

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

[23]  Philippe Baptiste,et al.  Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times , 1999 .

[24]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[25]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .