This is a preview of subscription content, log in via an institution to check access.
Literature Cited
S. Johnson, “An optimal schedule for two and three-stage process,” Kiberneticheskii sbornik, novaya seriya, no. 1, Moscow (1965).
V. V. Shkurba, Scheduling Theory, I. Combinatorial Problems [in Russian], KDNTP, Kiev (1964).
R. Bellman and S. Dreyfus, Applied Dynamic Programming [Russian translation], Moscow (1965).
E. Ignall and L. Schrage, “Application of the branch-and-bound technique to some flow-shop scheduling problems,” Operations Research,13, no. 3, 400–412 (1965).
Z. A. Lomnicki, “A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem,” Operations Research Quarterly,16, no. 1, 89–100 (1965).
V. S. Mikhalevich and V. V. Shkurba, “Sequential optimization methods in problems of operation scheduling,” Kibernetika [Cybernetics], no. 2, Kiev (1966).
G. Jaeschke, “Das Reihenfolgeproblem für Erzeugnisse mit gleichen Ablaufplan (RFI),” Electron. Rechenanlag,6, no. 3, 137–144 (1964).
Additional information
Dniepropetrovsk State University. Translated from Kibernetika, Vol. 5, No. 3, pp. 74–76, May–June, 1969.
Rights and permissions
About this article
Cite this article
Burdyuk, V.Y. The m-machine problem (m>2). Cybern Syst Anal 5, 326–329 (1969). https://doi.org/10.1007/BF01070921
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070921