Skip to main content
SpringerLink
Log in

Computing schemes for solution of problems in scheduling theory

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. R. Bellman, “Mathematical aspects of scheduling theory,” J. Soc. Ind. Appl. Math., 4, no. 3, 168–205, 1965.

    Google Scholar 

  2. V. V. Shkurba, “Scheduling theory. I, Combinatory problems,” Seminar on Economic Cybernetics and Operations Research [in Russian], KDNTP, Kiev, 1964.

    Google Scholar 

  3. V. V. Shkurba, “Scheduling theory. II, General approaches and simulation methods,” Seminar on Economic Cybernetics and Operations Research [in Russian], KDNTP, Kiev, 1964.

    Google Scholar 

  4. G. Dantzing, “A machine-job scheduling model,” Manag. Sci., 6, no. 2, 191–196, 1960.

    Google Scholar 

  5. Yu. V. Glebskii and V. N. Shevchenko, “On the construction of an optimal operation plan,” Nauchnye trudy MIEI, no. 20, Moscow, 1964.

  6. Network Planning Methods [in Russian], ed. N. I. Veduta and S. A. Dumler, Kiev, 1964.

  7. L. Ford, Network Flow Theory, Rand. Corp. paper., R-923, 1956.

  8. A. A. Bakayev et al., “Determination of the characteristics of a transporation network with the method of sequential analysis of variants,” DAN UkrSSR, no. 4, 1962.

  9. W. E. Smith, “Various optimizers for single-state production,” Nav. Res. Log. Quart. 3, 59–66, 1956.

    Google Scholar 

  10. L. G. Mitten, “A scheduling problem,” J. of Ind. Engr., 10, 131–134, 1959.

    Google Scholar 

  11. R. Bellman, “The application of dynamic programming to the traveling salesman problem,” Cybernetics Collection [in Russian], no. 9, Moscow, 1964.

  12. I. D. C. Little et al., “An algorthm for the traveling salesman problem,” Oper. Res., 11, no. 6, 1963.

    Google Scholar 

  13. S. A. Dumler, “Optimization of movement and process control,” Nauchnye trudy MIEI, no. 20, Moscow. 1964.

  14. A. L. Lur'e, “On certain calendar planning problems,” Collection: Problems of Cybernetics [in Russian], no. 7, Moscow, 1962.

  15. H. M. Wagner, “An integer linear programming model for machine scheduling,” Nav. Res. Log. Quart., 6, 131–140, 1959.

    Google Scholar 

  16. Yu. S. Shvarts, “An automatic process of ordering models and its application to parallel programming,” Cybernetics Collection [in Russian], no. 9, Moscow, 1964.

  17. S. Lambourn, “RAMPS—a new tool in planning and control,” The Computer Journal, vol. 5, no. 4, 300–304, 1963.

    Google Scholar 

Download references

Authors
  1. V. V. Shkurba
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

17 March 1965

Kibernetika, Vol. 1, No. 3, pp. 72–75, 1965

This survey is a summmary of a report read to the All-Union Conference on Computaional Mathematics in Moscow in January 1965. In contrast to [2] and [3], this article discusses theoretical aspects of the methods for solving scheduling problems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shkurba, V.V. Computing schemes for solution of problems in scheduling theory. Cybern Syst Anal 1, 74–78 (1965). https://doi.org/10.1007/BF01885706

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01885706

Keywords

Search

Navigation