Skip to main content
SpringerLink
Log in

A scheduling algorithm for serving many demands

  • 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. A. B. Barskii, “Minimization of the number of computers in the implementation of a computational process in prescribed time,” Tekh. Kibernetika, No. 6 (1968).

  2. O. Ore, Theory of Graphs, American Mathematical Society, Providence (1962).

    Google Scholar 

  3. I. A. Radchik, A Mathematical Model of Network Planning [in Russian], Nauka, Moscow (1965).

    Google Scholar 

Download references

Authors
  1. V. V. Lapin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 90–94, March–April, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lapin, V.V. A scheduling algorithm for serving many demands. Cybern Syst Anal 12, 267–272 (1976). https://doi.org/10.1007/BF01069898

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation