Skip to main content
SpringerLink
Log in

One method of estimating the resource level needed for implementing a partially ordered aggregate of operations in a specified time

  • 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. N. Z. Shor, “On one approach to multitheme planning problems,” Theses and Reports, First All-Union Conference on Mathematical Aspects of Network Planning [in Russian], Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1967).

    Google Scholar 

  2. L. E. Kornilova, “Optimal scheduling of resources in a planning network by the minimal flow method,” Kibernetika, No. 6 (1970).

  3. A. I. Kuksa, “Estimates of the duration of the shortest schedules in network planning problems with unstorable resources,” in: Theory of Optimal Decisions [in Russian], Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1975).

    Google Scholar 

Download references

Authors
  1. A. I. Kuksa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. A. Safronov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 126–130, May–June, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuksa, A.I., Safronov, I.A. One method of estimating the resource level needed for implementing a partially ordered aggregate of operations in a specified time. Cybern Syst Anal 14, 449–453 (1978). https://doi.org/10.1007/BF01074680

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation