Skip to main content
SpringerLink
Log in

Classes of schedules

  • 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

Literature Cited

  1. V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  2. R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass. (1967).

    Google Scholar 

  3. B. Griffer and G. L. Thompson, “Algorithms for solving production scheduling problems,” Oper. Res.8, No. 4, 487–503 (1960).

    Google Scholar 

  4. J. Heller and G. Logemann, “An algorithm for the construction and evaluation of feasible schedules,” Manag. Sci.,8, No. 2, 168–183 (1962).

    Google Scholar 

  5. Production Scheduling [in Russian], Progress, Moscow (1966).

  6. V. V. Shkurba, “Application of the Monte Carlo method to scheduling,” in: Mathematical Methods in Production Organization and Economics [in Russian], Moscow (1966), pp. 209–223.

Download references

Authors
  1. S. A. Kantsedal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. N. Malykh
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 66–74, November–December, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kantsedal, S.A., Malykh, O.N. Classes of schedules. Cybern Syst Anal 17, 793–801 (1981). https://doi.org/10.1007/BF01069230

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation