ISSN:
1572-9338
Keywords:
Preemptive single machine scheduling
;
finite input buffers
;
polynomial time algorithm
;
NP-complete
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract In many scheduling problems, an arriving job is stored in an input buffer until it starts to be processed. Also, it may be necessary to hold a partially completed preempted job in an input buffer until processing of this job resumes. In the scheduling literature, most problems have been studied using the implicit assumption that the buffer has infinite capacity. We study preemptive single machine scheduling problems where the buffer capacity is finite. In this scheduling environment, jobs may be lost either because of insufficient input buffer capacity, or because due date requirements cannot be met. We examine problems where the objective is to minimize the weighted or unweighted number of lost jobs. Various assumptions about the generality of the data are examined. We present a complexity classification for various problems, either by deriving an efficient algorithm, or by proving that such an algorithm is unlikely to exist.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1018990625142
Permalink
