This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. Ya. Burdyuk, “Regular g-orderings and Smith functions,” Kibernetika, No. 2 (1975).
V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).
V. V. Martynyuk, “On transitively equivalent directed graphs,” Kibernetika, No. 1 (1973).
V. S. Gordon and Ya. M. Shafranskii, “Optimal ordering in the presence of sequence-parallel precedence constraints,” Dokl. Akad. Nauk BSSR,22 (1978).
M. Sh. Levin and E. V. Levner, “On an effective solution of the Bellman—Johnson problem on a network having the form of a tree,” Avtom. Telemekh., No. 10 (1978).
D. L. Adolphon, “Single machine job sequencing with precedence constraints” SIAM J. Comput.,6, No. 1 (1977).
E. L. Lawler, “Optimal sequencing constraints,” Math. Cent. Afd. Math. Beslisk BW, No. 54 (1975).
Additional information
Translated from Kibernetika, No. 1, pp. 99–103, January–February, 1980.
Rights and permissions
About this article
Cite this article
Burdyuk, V.Y., Reva, V.N. Method for optimzing functionals of permutations in the presence of constraints. Cybern Syst Anal 16, 111–117 (1980). https://doi.org/10.1007/BF01099370
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01099370