Skip to main content
SpringerLink
Log in

The stochastic problem of two machines

  • 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. S. Johnson, “Optimal scheduling for two- and three-step processes,” Kiberneticheskii sb., Novaya seriya [Russian translation], no. 1, Mir, Moscow, 1965.

    Google Scholar 

  2. V. V. Shkurba et al., Problems of Calendar Planning and Methods of Solution [in Russian], izd-vo Naukova dumka, Kiev, 1966.

    Google Scholar 

  3. N. M. Lobanovskii, “On the optimal planning of the sequence in which work is carried out on one or two machine,” in: Cybernetics and Control [in Russian], izd-vo Nauka, Moscow, 1967.

    Google Scholar 

  4. B. V. Gnedenko, Yu. K. Belyaev, and A. D. Solov'ev, Mathematical Methods in Reliability Theory [in Russian], izd-vo Nauka, Moscow, 1965.

    Google Scholar 

  5. Toji Makino, “On a scheduling problem,” J. Operat. Res. Soc. Japan, 8, no. 1, 1965.

Download references

Authors
  1. V. Ya. Burdyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dnepropetrovsk State University. Translated from Kibernetika, Vol. 5, No. 5, pp. 110–114, September–October, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burdyuk, V.Y. The stochastic problem of two machines. Cybern Syst Anal 5, 656–661 (1969). https://doi.org/10.1007/BF01267890

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation