Preemptive scheduling with release dates, delivery times and sequence independent setup times

Abstract This paper deals with the single-machine scheduling problem in which each job has a release date, a processing time and a delivery time. Preemption is permitted and a sequence-independent setup time is incurred before processing a job. The objective is to find a schedule which minimizes the time by which all jobs are delivered. We show that the problem is NP-hard and propose a heuristic algorithm with a tight worst-case performance bound of 3 2 and which requires O(n log n) time.

[1]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

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

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

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

[5]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[6]  Stanisław Zdrzałka.  Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times , 1995 .

[7]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[8]  Stanisłlaw Zdrzałka.  Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times , 1991 .

[9]  C. N. Potts,et al.  Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times , 1980, Oper. Res..

[10]  Clyde L. Monma,et al.  Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times , 1993, Oper. Res..

[11]  David B. Shmoys,et al.  Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better , 1992, Math. Oper. Res..

[12]  E. Nowicki,et al.  A block approach for single-machine scheduling with release dates and due dates , 1986 .

[13]  Reha Uzsoy,et al.  Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine , 1992 .

[14]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .