Skip to main content
SpringerLink
Log in

Parametric problem in scheduling theory

  • 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. V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  2. O. I. Mel'nikov, “Parametric Bellman-Johnson problem,” Materials of the Third Conference of Young Scholars and of the Specialists of the Institute of Engineering Cybernetics of the Academy of Sciences of the Belorussian SSR [in Russian], Minsk (1977).

  3. G. von Jaeschke, “Das Reihenfolgeproblem für Erzeugnisse mit gleichem Ablaufplan (RF 1),” Elektron. Rechenanlagen, No. 3 (1964).

Download references

Authors
  1. O. I. Mel'nikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ya. M. Shafranskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 53–57, May–June, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mel'nikov, O.I., Shafranskii, Y.M. Parametric problem in scheduling theory. Cybern Syst Anal 15, 352–357 (1979). https://doi.org/10.1007/BF01075095

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation