This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
V. S. Tanaev and V. V. Shkurba, Introduction to the Theory of Scheduling [in Russian], Nauka, Moscow (1975)
R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, Addison-Wesley, Reading (1967).
W. A. Horn, “Single-machine job sequencing with tree-like precedence ordering and linear delay penalties,” SIAM J. Appl. Math.,23, No. 1 (1972).
V. S. Gordon and V. S. Tanaev, “Deterministic service system with a single facility with tree-like ordering of constraints and exponential penalty functions,” in: Computational Technique in Machine-Building [in Russian], Izd. Inst. Tekh. Kibern. Akad. Nauk BSSR, Minsk (1973).
D. Adolphson and T. C. Hu, “Optimal linear ordering,” SIAM J. Appl. Math.,25, No. 3, 403–423 (1973).
J. B. Sidney, “Decomposition algorithms for single-machine sequencing with precedence relations and deferal costs,” Oper. Res.,23, No. 2, 283–298 (1975).
J. D. Ullman, “NP-Complete scheduling problems,” J. Comput. Syst. Sci., No. 10, 384–393 (1975).
É. M. Livshits, “Sequence of operations for the preparation of complex details,” Avtom. Telemekh., No. 11, Moscow (1968).
W. E. Smith, “Various optimizers for single stage production,” Nav. Res. Logist. Quart.,3, No. 1, 59–66 (1956).
S. M. Johnson, “Optimal scheduling for two and three-stage processes,” in: Cybernetical Collections [Russian translation], No. 1, New Series, Mir, Moscow (1965).
S. V. Yablonskii and O. B. Lupanov (editors), Discrete Mathematics and Mathematical Questions of Cybernetics [in Russian], Nauka, Moscow (1974).
D. E. Knuth, The Art of Computer Programming, Sorting and Searching, Addison-Wesley (1973).
S. E. Elmaghraby (editor), Symposium on the Theory of Scheduling and Its Applications, Lecture Notes in Economics and Mathematical Systems, Vol. 86, Springer-Verlag (1973).
Translated from Kibernetika, No. 1, pp. 131–135, January–February, 1980.
About this article
Cite this article
Levin, M.S. Effective solution of certain problems of theory of schedulings of nets. Cybern Syst Anal 16, 148–154 (1980). https://doi.org/10.1007/BF01099378
- Operating System
- Artificial Intelligence
- System Theory
- Effective Solution