A Branch-and-Check Algorithm for Minimizing the Sum of the Weights of the Late Jobs on a Single Machine with Release Dates

In this paper we consider the scheduling problem of minimizing the sum of the weights of the late jobs on a single machine (1|rj| [sum] wj Uj ). A branch-and-check algorithm is proposed, where a relaxed integer programming formulation is solved by branch-and-bound and infeasible solutions are cut off using unfeasibility cuts. We suggest two ways to generate cuts. First we show how the algorithm by Carlier [7] can be modified to produce tightened "no-good" cuts. We then demonstratehow to create cuts by using constraint propagation. The branch-and check algorithm proposed is implemented in the Mosel modelling and optimization language. Computational experiments show that our algorithm outperforms the exact approach of P©

[1]  Laurence A. Wolsey,et al.  Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem With Deadlines and Release Dates , 2003, INFORMS J. Comput..

[2]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

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

[4]  Ruslan Sadykov,et al.  Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem With Deadlines and Release Dates , 2003 .

[5]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

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

[7]  Y. Colombani,et al.  Mosel : An Extensible Environment for Modeling and Programming Solutions , .

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

[9]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

[10]  Stéphane Dauzère-Pérès,et al.  Genetic algorithms to minimize the weighted number of late jobs on a single machine , 2003, Eur. J. Oper. Res..

[11]  Erlendur S. Thorsteinsson.  Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming , 2001, CP.

[12]  Alexander Bockmayr,et al.  Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming , 1998, INFORMS J. Comput..

[13]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

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

[15]  John N. Hooker,et al.  Logic, Optimization, and Constraint Programming , 2002, INFORMS J. Comput..

[16]  Mark Wallace,et al.  Hybrid Benders Decomposition Algorithms in Constraint Logic Programming , 2001, CP.

[17]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

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

[19]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[20]  Alexander Bockmayr,et al.  Detecting Infeasibility and Generating Cuts for MIP using CP , 2003 .

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

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

[23]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

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

[25]  J. Carlier.  The one-machine sequencing problem , 1982 .

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