This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. Aho and J. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).
M. R. Garey and D. S. Johnson, “Scheduling tasks with nonuniform deadlines on two processors,” J. ACM,23, 461–467 (1976).
M. R. Garey and D. S. Johnson, “Two-processor scheduling with start times and deadlines,” SIAM J. Comput.,6, No. 3, 416–426 (1977).
P. Brucker, M. R. Garey, and D. S. Johnson, “Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness,” Math. Oper. Res.,2, No. 3, 275–284 (1977).
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, No. 2, 256–269 (1981).
Additional information
Translated from Kibernetika, No. 1, pp. 72–75, January–February, 1985.
Rights and permissions
About this article
Cite this article
Zinder, Y.A., Shkurba, V.V. Effective iterative algorithms in scheduling theory. Cybern Syst Anal 21, 86–90 (1985). https://doi.org/10.1007/BF01075122
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01075122