Skip to main content
SpringerLink
Log in

Comparison of lower bounds to the lengths of deterministic multiprocessor 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. N. Z. Shor, “An approach to multitime planning,” in: Abstracts for the First All-Union Conference on Mathematical Aspects of Network Planning and Management [in Russian], Kiev (1967).

  2. A. B. Barskii, “Minimization of the number of computers to implement computational process in a given time,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6 (1968).

  3. V. Zaloom, “On the resource constrained project scheduling problem,” AIIE Trans., 3, No. 4 (1971).

  4. E. B. Fernandez and T. Lang, “Computation of lower bounds for multiprocessor schedules,” IBM J. R and D, 19, No. 5 (1975).

    Google Scholar 

  5. A. I. Kuksa, “Bounds for the lengths of shortest schedules for network planning with unstorable resources,” in: Theory of Optimal Decisions [in Russian], Izd. Inst. Kibernetika Akad. Nauk Ukr. SSR, Kiev (1975).

    Google Scholar 

  6. M. R. Garey and D. S. Johnson, “Complexity results for multiprocessor scheduling under resource constraints,” SIAM Comput., 4, No. 4 (1975).

  7. S. S. Trusov, “The performance of a simple executive,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4 (1973).

  8. A. I. Kuksa and I. A. Safronov, “A method of estimating the level of resources required to execute a partially ordered set of operations in a given time,” Kibernetika, No. 2 (1968).

Download references

Authors
  1. A. I. Kuksa
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 87–90, September–October, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuksa, A.I. Comparison of lower bounds to the lengths of deterministic multiprocessor schedules. Cybern Syst Anal 15, 698–703 (1979). https://doi.org/10.1007/BF01071221

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation