Advertisement

Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Optimal scheduling for one machine with incomplete information

  • 18 Accesses

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

    V. V. Shkurba, “Scheduling theory, I. Combinatorial problems,” in: Economic Cybernetics and Operations Research [in Russian], KDNTP, Kiev (1964).

  2. 2.

    M. N. Rothkopf, “Scheduling with random service times,” Management Science,12, No. 9 (1966).

  3. 3.

    A. A. Fel'dbaum, Fundamentals of the Theory of Optimal Automatic Systems [in Russian], Nauka, Moscow (1966).

Download references

Additional information

Translated from Kibernetika, No. 4, pp. 149–151, July–August, 1971.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Feigin, L.I. Optimal scheduling for one machine with incomplete information. Cybern Syst Anal 7, 748–751 (1971). https://doi.org/10.1007/BF01071051

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory
  • Incomplete Information
  • Optimal Schedule