Skip to main content
SpringerLink
Log in

Minimization of the time for executing a project given by a tree

  • 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. T. C. Hu, “Parallel sequencing and assembly line problems,” Operat. Res.,9, 841–848 (Nov., 1961).

    Google Scholar 

  2. C. V. Ramamoorthy, K. M. Chandy, and M. J. Gonzales, “Optimal scheduling strategies in a multiprocessor system,” IEEE Trans. Computers,C-21, No. 2, 137–146 (1972).

    Google Scholar 

  3. C. Berge, The Theory of Graphs and Its Applications, Methuen, London (1962).

    Google Scholar 

Download references

Authors
  1. E. M. Gol'dgaber
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 102–107, March–April, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gol'dgaber, E.M. Minimization of the time for executing a project given by a tree. Cybern Syst Anal 13, 253–260 (1977). https://doi.org/10.1007/BF01073319

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation