Skip to main content
SpringerLink
Log in

One extremal problem 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

Literature Cited

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

  2. V. V. Shkurba et al., Calendar Planning Problems and Methods for Solving Them [in Russian], Izd. Naukova Dumka, Kiev (1966).

    Google Scholar 

  3. V. Ya. Burdyuk and V. V. Shkurba, “Scheduling theory. Problems and solution methods. I,” Kibernetika, No. 1, Kiev (1971).

  4. K. Kuratowski and A. Mostowski, Set Theory, S-H Services Agency (1968).

  5. G. H. Hardy, D. E. Littlewood, and G. Polya, Inequalities [Russian translation], GIIL, Moscow (1948).

    Google Scholar 

  6. V. Ya. Burdyuk, “The problem n/1+1/F with blocking,” Scientific Seminars (Mechanics and Mathematics) [in Russian], Izd. Dnepropetrovskogo Gosuniversiteta (1970).

Download references

Authors
  1. V. Ya. Burdyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 103–108, May–June 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burdyuk, V.Y. One extremal problem in scheduling theory. Cybern Syst Anal 9, 487–493 (1973). https://doi.org/10.1007/BF01069206

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation