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.
Similar content being viewed by others
References
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic machine scheduling: A survey, Annals of Discrete Mathematic 5(1979) 287–326.
N.G. Hall, M.E. Posner and C.N. Potts, Scheduling with finite capacity output buffers, Operations Research (1997), to appear.
N.G. Hall, M.E. Posner and C.N. Potts, Scheduling with finite capacity input buffers, Operations Research (1997), to appear.
R.L. Kruse, Data Structures and Program Design, 2nd ed., Prentice-Hall, Englewood Cliffs, NJ, 1987.
J.O. McClain and L.J. Thomas, Operations Management, 2nd ed., Prentice-Hall, Englewood Cliffs, N.J., 1985.
W.M. Nawijn, Minimum loss scheduling problems, European Journal of Operational Research 56 (1992)364–369.
W.M. Nawijn, W. Kern and S. Baas, Scheduling jobs with release times on a machine with finite storage, European Journal of Operational Research 74(1994)120–127.
Rights and permissions
About this article
Cite this article
Hall, N.G., Posner, M.E. & Potts, C.N. Preemptive scheduling with finite capacity input buffers. Annals of Operations Research 70, 399–413 (1997). https://doi.org/10.1023/A:1018990625142
Issue Date:
DOI: https://doi.org/10.1023/A:1018990625142