论文信息 - Minimizing late jobs in the general one machine scheduling problem

Minimizing late jobs in the general one machine scheduling problem

Abstract In this paper, the problem of minimizing the number of late jobs on one machine is investigated. The general problem is considered, i.e., with release dates and different due dates. A lower bound is first proposed, based on the relaxation of a Mixed-Integer Linear Programming formulation of the problem. A heuristic is then presented. Its effectiveness is computationally studied by comparison with the lower bound.

Stéphane Dauzère-Pérès | S. Dauzère-Pérès | S. Dauzére-Pérés

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

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

[3] George L. Nemhauser,et al. Handbooks in operations research and management science , 1989 .

[4] Nicholas G. Hall. Scheduling Problems With Generalized Due Dates , 1986 .

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

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

[7] Martin E. Dyer,et al. Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[8] Maurice Queyranne,et al. Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling , 1992, IPCO.

[9] Chelliah Sriskandarajah,et al. On the Complexity of Generalized Due Date Scheduling Problems , 1991 .