Abstract
The optimal scheduling problem of parallel identical machines is reduced by the resource approach to optimal permutation scheduling of jobs. Permutation scheduling algorithms for this problem are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass. (1967).
V. S. Mikhalevich, and A. I. Kuksa, Methods of Sequential Optimization in Discrete Network Problems of Optimal Resource Allocation [in Russian], Nauka, Moscow (1983).
V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).
V. S. Tanaev, V. S. Gordon, and Ya. N. Shafranskii, Scheduling Theory Single-State Systems [in Russian], Nauka, Moscow (1984).
É. G. Koffman (ed.), Scheduling Theory and Computers [in Russian], Nauka, Moscow (1984).
A. N. Khodzinskii, “Results of a machine experiment solving one type of scheduling problems by a branch-and-bound method and a vector descent method,” in: Development of Mathematical and Technical Tools for MIS [in Russian], IK Akad. Nauk UkrSSR, Kiev (1978), pp. 17–24.
V. A. Bondarenko and V. V. Shevernitskii, Program Package for Optimal Scheduling Problems STAR [in Russian], FAP Akad. Nauk UkrSSR, Kiev, No. AP0207 30.06.88 (1988).
Additional information
Translated from Kibernetika, No. 1, pp. 81–83, 111, January–February, 1990.
Rights and permissions
About this article
Cite this article
Bondarenko, V.A. Permutation schedules. Cybern Syst Anal 26, 101–105 (1990). https://doi.org/10.1007/BF01068235
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068235