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

Complexity of optimal scheduling problems with three jobs

  • 38 Accesses

  • 1 Citations

Abstract

We consider the time-optimal scheduling problemn/m/J \(\bar t_{\max } \) of n jobs with fixed routes on m machines. The problem3/m/J/\(\bar t_{\max } \) with identical routes and the problem3/5/J/\(\bar t_{\max } \) are shown to be NP-hard. Similar results are obtained for the problem of minimizing the mean processing time of three jobs on m machines.

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

Literature Cited

  1. 1.

    V. S. Mikhalevich and A. I. Kuksa, Sequential Optimization Methods (in discrete network problems of optimal resource allocation) [in Russian], Nauka, Moscow (1983).

  2. 2.

    V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskii, Scheduling Theory. Single-Stage Systems [in Russian], Nauka, Moscow (1984).

  3. 3.

    M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, San Francisco (1979).

  4. 4.

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

  5. 5.

    Yu. N. Sotskov, “Optimal scheduling of two jobs with a regular criterion,” in: Computer-Aided Design Processes [in Russian], Inst. Tekhn. Kibern. Akad. Nauk BSSR, Minsk (1985), pp. 86–95.

  6. 6.

    T. Gonzalez and S. Sahni, “Open shop scheduling to minimize finish time,” J. Assoc. Comput. Mach.,23, No. 4, 665–679 (1976).

  7. 7.

    V. A. Strusevich, “On time-optimal schedules for a multi-stage system with free routes through the stages,” Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk, No. 6, 43–48 (1986).

  8. 8.

    S. A. Borodich and V. A. Strusevich, Processing of an Ordered Set of Jobs in a System with Free Routes [in Russian], Inst. Mat. Akad. Nauk BSSR, Minsk, No. 7(243) (1986).

Download references

Additional information

Translated from Kibernetika, No. 5, pp. 50–54, September–October, 1990.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Sotskov, Y.N. Complexity of optimal scheduling problems with three jobs. Cybern Syst Anal 26, 686–692 (1990). https://doi.org/10.1007/BF01068549

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • Processing Time
  • Schedule Problem
  • System Theory