Abstract
Algorithms for the scheduling of unit-time jobs with release times and deadlines on one or many identical machines are presented and generalizations which result in NP-complete problems are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
P. V. E. Boas, “Preserving order in a forest in less than logarithmic time,” 16th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Long Beach, California, 1978, pp. 75-84.
J. Carlier, “Problème à une machine dans le cas où les tâches ont des durées égales,” Technical Report Institut de Programmation, Université Paris VI (1979).
S. A. Cook, “The complexity of theorem-proving procedures,” Proc. of the Third Annual ACM Symp. on Theory of Computing, pp. 151-158.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP’-Completeness, W. H. Freeman, San Francisco, California, 1978.
M. R. Garey and D. S. Johnson, “Two-processor scheduling with start-times and deadlines,” SIAM J. Comput., 6 (1977), pp. 416–426.
M. R. Garey, D. S. Johnson, B. B. Simons, and R. E. Tarjan, “Scheduling unit-time tasks with arbitrary release times and deadlines,” SIAM J. Comput. 10 (1981), pp. 256–269.
Z. Galil and N. Megiddo, “A fast selection algorithm and the problem of optimal distribution of effort,” J. Acm, 26, 1 (1979), pp. 58–64.
J. R. Jackson, “Scheduling a production line to minimize maximum tardiness,” Research Report 43 (1955), Management Science Research Project, UCLA.
D. B. Johnson and T. Mizoguchi, “Selecting the kth element in X + Y and X1 + X2 + …+ Xm” SIAM J. Comput.,7 (1978), pp. 147–153.
R. M. Karp, “Reducibility among combinatorial problems,” Complexity of Computer Computations, R. E. Miller and J. M. Thatcher, eds., Plenum Press, New York, 1972, pp. 85–103.
J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker, “Complexity of machine scheduling problems,” Annals of Discrete Mathematics, 1 (1977), pp. 343–362.
B. B. Simons, “A fast algorithm for multiprocessor scheduling,” 21st Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Long Beach, California, 1980, pp. 50–53.
B. B. Simons, “A fast algorithm for single processor scheduling,” 19th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Long Beach, California, 1978, pp. 246–252.
B. B. Simons, “Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines,” IBM Research Report RJ 3235 (1981), San Jose, Ca.
B. B. Simons, “Minimizing maximum lateness of unit-time jobs with arbitrary release times and deadlines,” IBM Research Report RJ 3236 (1981), San Jose, Ca.
B. B. Simons and M. F. Sipser, “On scheduling unit time jobs with multiple release time/deadline intervals,” IBM Research Report RJ 3236 (1981), San Jose, Ca.
J. D. Ullman, “NP-complete scheduling problems,” Journal of Computer and System Sciences, 10 (1975), pp. 384–393.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 D. Reidel Publishing Company
About this paper
Cite this paper
Simons, B. (1982). On Scheduling with Release Times and Deadlines. In: Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds) Deterministic and Stochastic Scheduling. NATO Advanced Study Institutes Series, vol 84. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7801-0_4
Download citation
DOI: https://doi.org/10.1007/978-94-009-7801-0_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7803-4
Online ISBN: 978-94-009-7801-0
eBook Packages: Springer Book Archive