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

An algorithm for the solution of the two-route Johnson problem

  • 28 Accesses

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

Literature Cited

  1. 1.

    S. Johnson, “Optimal schedules for two- and three-stage processes,” Kibern. Sb., No. 1, 78–86 (1965).

  2. 2.

    M. R. Garey, D. S. Johnson, and Sethi Ravi, “The complexity of flowshop and jobshop scheduling,” Math. Oper. Res., No. 2, 117–129 (1976).

  3. 3.

    R. Conway, W. Maxwell, and L. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass. (1967).

  4. 4.

    V. S. Tanaev and V. V. Shkurba, An Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).

  5. 5.

    T. P. Podchasova, V. N. Portugal, V. A. Tatarov, and V. V. Shkurba, Heuristic Methods of Scheduling [in Russian], Tekhnika, Kiev (1980).

  6. 6.

    I. S. Belov and Ya. N. Stolin, “An algorithm for the one-route scheduling problem,” in: Mathematical Economics and Functional Analysis [in Russian], Nauka, Moscow (1974), pp. 248–257.

  7. 7.

    S. V. Sevast'yanov, “On an asymptotic approach to some problems of scheduling theory,” Upr. Sistemy, No. 14, 40–51 (1975).

  8. 8.

    A. I. Babushkin, A. L. Bashta, and I. S. Belov, “Scheduling for the problem with oppositely directed routes,” Kibernetika, No. 4, 130–135 (1974).

  9. 9.

    A. I. Babushkin, A. L. Bashta, and I. S. Belov, “Scheduling for the multiroute problem with three machines,” Avtomat. Telemekh., No. 7, 154–158 (1976).

  10. 10.

    S. V. Sevast'yanov, “An algorithm with bounds for the problems of Johnson and Akers-Friedman in the three-machine case,” Upr. Sistemy, No. 22, 51–57 (1982).

  11. 11.

    M. I. Kadets, “On one property of vector polygonal lines in n-dimensional space,” Usp. Mat. Nauk,8, No. 1, 139–143 (1953).

  12. 12.

    V. S. Grinberg and S. V. Sevast'yanov, “On the value of the Steinitz constant,” Funkts. Anal.,14, No. 2, 56–57 (1980).

  13. 13.

    S. V. Sevast'yanov, “Some generalizations of Johnson's problem,” Upr. Sistemy, No. 21, 46–61 (1981).

  14. 14.

    S. V. Sevast'yanov, “Approximate algorithms in Johnson problems and vector summation,” Upr. Sistemy, No. 21, 64–73 (1980).

  15. 15.

    V. Ya. Burdyuk and V. V. Shkurba, “Scheduling theory. Problems and methods of solution, I,” Kibernetika, No. 1, 89–102 (1971).

  16. 16.

    S. V. Sevast'yanov, “Effective construction of nearly optimal schedules for cases of arbitrary and alternative routes,” Dokl. Akad. Nauk SSSR,276, No. 1, 46–48 (1984).

Download references

Additional information

Translated from Kibernetika, No. 3, pp. 53–58, May–June, 1988.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Dushin, B.I. An algorithm for the solution of the two-route Johnson problem. Cybern Syst Anal 24, 336–343 (1988). https://doi.org/10.1007/BF01132086

Download citation


  • Operating System
  • Artificial Intelligence
  • System Theory
  • Johnson Problem