Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

On the question of “restricting” branching in one-machine problems

  • 8 Accesses

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

Literature Cited

  1. 1.

    G. K. Kladov and É. M. Livshits, “On the problem of minimizing the sum of penalties in setting up a schedule,” Kibernetika, No. 6 (1968).

  2. 2.

    V. V. Shkurba, “Precedence intervals in ordering problems,” Kibernetika, No. 2 (1970).

Download references

Additional information

Translated from Kibernetika, No. 1, pp. 145–147, January–February, 1972.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kitik, M.G. On the question of “restricting” branching in one-machine problems. Cybern Syst Anal 8, 165–168 (1972). https://doi.org/10.1007/BF01069152

Download citation


  • Operating System
  • Artificial Intelligence
  • System Theory