Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals

This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e. , their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due dates. The release/due date intervals are nested, i.e. , no two of them overlap (either they have at most one common point or one covers the other). Necessary and sufficient conditions for the completion of all jobs in time are considered, and an O(n logn ) algorithm (where n is the number of jobs) is proposed for solving the problem of minimizing the weighted number of late jobs in case of oppositely ordered processing times and weights.

[1]  Jan Karel Lenstra,et al.  Complexity results for scheduling chains on a single machine : (preprint) , 1980 .

[2]  Clyde L. Monma,et al.  Linear-Time Algorithms for Scheduling on Parallel Processors , 1982, Oper. Res..

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

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

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

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

[7]  Valery Gordon,et al.  Single machine scheduling with deadlines, release and due dates , 1996, Proceedings 1996 IEEE Conference on Emerging Technologies and Factory Automation. ETFA '96.

[8]  V. Tanaev,et al.  Scheduling theory single-stage systems , 1994 .

[9]  Jeffrey B. Sidney,et al.  An Extension of Moore’s Due Date Algotithm , 1973 .

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

[11]  Valery Gordon,et al.  Single machine scheduling with deadlines, release and due dates , 1997 .

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

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

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

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