论文信息 - A Branch and Bound Method to Minimize the Number of Late Jobs on a Single Machine

A Branch and Bound Method to Minimize the Number of Late Jobs on a Single Machine

The paper considers the problem of scheduling n jobs on a single machine to minimize the number of tardy jobs (or late jobs). Each job has a release date, a processing time and a due date. The general case with non-equal release dates and diierent due dates is considered. Using new and eecient lower bounds, a branch and bound scheme is proposed based on the deenition of a master sequence, i.e., a sequence containing at least an optimal sequence. Numerical experiments are presented.

Stéphane Dauzère-Pérès | Marc Sevaux

[1] Stéphane Dauzère-Pérès,et al. Various Mathematical Programming Formulations for a General One Machine Sequencing Problem , 1998 .

[2] Eugene L. Lawler,et al. Scheduling a Single Machine to Minimize the Number of Late Jobs , 1983 .

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

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

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

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