Cybernetics

, Volume 24, Issue 3, pp 336–343 | Cite as

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

  • B. I. Dushin
Article
  • 26 Downloads

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    S. Johnson, “Optimal schedules for two- and three-stage processes,” Kibern. Sb., No. 1, 78–86 (1965).Google Scholar
  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).Google Scholar
  3. 3.
    R. Conway, W. Maxwell, and L. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass. (1967).Google Scholar
  4. 4.
    V. S. Tanaev and V. V. Shkurba, An Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).Google Scholar
  5. 5.
    T. P. Podchasova, V. N. Portugal, V. A. Tatarov, and V. V. Shkurba, Heuristic Methods of Scheduling [in Russian], Tekhnika, Kiev (1980).Google Scholar
  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.Google Scholar
  7. 7.
    S. V. Sevast'yanov, “On an asymptotic approach to some problems of scheduling theory,” Upr. Sistemy, No. 14, 40–51 (1975).Google Scholar
  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).Google Scholar
  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).Google Scholar
  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).Google Scholar
  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).Google Scholar
  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).Google Scholar
  13. 13.
    S. V. Sevast'yanov, “Some generalizations of Johnson's problem,” Upr. Sistemy, No. 21, 46–61 (1981).Google Scholar
  14. 14.
    S. V. Sevast'yanov, “Approximate algorithms in Johnson problems and vector summation,” Upr. Sistemy, No. 21, 64–73 (1980).Google Scholar
  15. 15.
    V. Ya. Burdyuk and V. V. Shkurba, “Scheduling theory. Problems and methods of solution, I,” Kibernetika, No. 1, 89–102 (1971).Google Scholar
  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).Google Scholar

Copyright information

© Plenum Publishing Corporation 1989

Authors and Affiliations

  • B. I. Dushin

There are no affiliations available

Personalised recommendations