A branch and bound to minimize the number of late jobs on a single machine with release time constraints

Abstract This paper presents a branch and bound algorithm for the single machine scheduling problem 1| r i |∑ U i where the objective function is to minimize the number of late jobs. Lower bounds based on a Lagrangian relaxation and no reductions to polynomially solvable cases are proposed. Efficient elimination rules together with strong dominance relations are also used to reduce the search space. A branch and bound exploiting these techniques solves to optimality instances with up to 200 jobs, improving drastically the size of problems that could be solved by exact methods up to now.

[1]  Pierre Lopez.  Approche énergétique pour l'ordonnancement de tâches sous contraintes de temps et de ressources. (Energy-based approach for task scheduling under time and resource constraints) , 1991 .

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

[3]  S. Dauzere-Peres.  An efficient formulation for minimizing the number of late jobs in single-machine scheduling , 1997, 1997 IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, EFTA '97.

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

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

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

[7]  David Rivreau,et al.  Problèmes d'ordonnancement disjonctifs : règles d'élimination et bornes inférieures , 1999 .

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

[9]  Peter Brucker,et al.  The job-shop problem and immediate selection , 1994, Ann. Oper. Res..

[10]  Stéphane Dauzère-Pérès,et al.  A Branch and Bound Method to Minimize the Number of Late Jobs on a Single Machine , 1998 .

[11]  François Laburthe,et al.  Disjunctive Scheduling with Task Intervals , 1995 .

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

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

[14]  Laurent Péridy.  Le problème de job-shop : arbitrages et ajustements , 1996 .

[15]  J. Erschler,et al.  Characterizing the set of feasible sequences for n jobs to be carried out on a single machine , 1980 .

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

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

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

[19]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[20]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

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

[22]  Zhaohui Liu,et al.  Minimizing the Number of Late Jobs under the Group Technology Assumption , 1999, J. Comb. Optim..

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

[24]  P. Baptiste,et al.  Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling , 1996 .

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

[26]  Philippe Baptiste,et al.  Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints , 1998, CP.

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