This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).
I. V. Sergienko, I. N. Parasyuk, and N. I. Tukalevskaya, Automated Data Processing Systems [in Russian], Naukova Dumka, Kiev (1976).
R. M. Karp, “Reducibility of combinatorial problems,” Kibern. Sb. Nov. Ser., No. 12, 16–38 (1975).
P. Brucker, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Complexity of machine scheduling problems,” Math. Cent. Afd. Math. Beslisk. B. W., No., 43 (1975).
W. H. Kohler and K. Steiglitz, “Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems,” J. ACM,21, No. 1, 140–156 (1974).
Additional information
Translated from Kibernetika, No. 3, pp. 51–53, May–June, 1980.
Rights and permissions
About this article
Cite this article
Andon, F.I., Kuksa, A.I. & Polyachenko, B.E. Optimal planning of computer processing of interrelated jobs. Cybern Syst Anal 16, 361–364 (1980). https://doi.org/10.1007/BF01078254
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01078254