This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. E. Serik, “The use of precedence intervals for solving precedence problems with constraints,” Kibernetika, No. 4, 61–65 (1982).
V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).
A. E. Serik, “The organization of computer computations on data-related programs,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4, 122–126 (1978).
N. Christofides, Graph Theory. An Algorithmic Approach, Academic Press, London (1975).
V. S. Gordon and Ya. M. Shafranskii, “Optimal ordering in parallel-serial procession constraints,” Dokl. Akad. Nauk BSSR,22, No. 3, 244–247 (1978).
O. Ore, Theory of Graphs, Am. Math. Soc., Providence, R. I. (1962).
I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods of Solving Combinatorial Optimization Problems on a Computer [in Russian], Naukova Dumka, Kiev (1981).
Additional information
Translated from Kibernetika, No. 3, pp. 29–33, 58, May–June, 1985.
Rights and permissions
About this article
Cite this article
Serik, A.E. Certain exact and approximate algorithms for solving precedence problems with constraints. Cybern Syst Anal 21, 308–315 (1985). https://doi.org/10.1007/BF01078824
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01078824