Skip to main content
SpringerLink
Log in

An algorithm for selecting the execution intensity of jobs in a schedule

  • 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. R. W. Conway, W. L. Maxwell, and L. W. Miller, Scheduling Theory, Addison-Wesley, Reading, Mass. (1967).

    Google Scholar 

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

    Google Scholar 

  3. V. G. Vizing, “Schedules with target times,” Kibernetika, No. 1, 128–135 (1981).

    Google Scholar 

  4. W. A. Horn, “Some simple scheduling algorithms,” Nav. Res. Log. Quart.,21, No. 1, 177–185 (1974).

    Google Scholar 

Download references

Authors
  1. V. G. Vizing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. N. Komzakova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. V. Tarchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 71–74, September–October, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vizing, V.G., Komzakova, L.N. & Tarchenko, A.V. An algorithm for selecting the execution intensity of jobs in a schedule. Cybern Syst Anal 17, 646–649 (1981). https://doi.org/10.1007/BF01068785

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation