Skip to main content
Springer Nature Link
Log in

Complete Complexity Classification of Short Shop Scheduling

  • Conference paper
Computer Science - Theory and Applications (CSR 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5675))

Included in the following conference series:

  • 556 Accesses

Abstract

In this paper a comprehensive complexity analysis of classical shop scheduling problems (open shop, job shop and mixed shop) is presented subject to joint constraints on several problem parameters, such as the maximum processing time of an operation, the maximum number of operations per job, and the schedule length. Thus, our research continues the research line on the complexity analysis of short scheduling initiated for the open shop and job shop problems in the paper by Williamson et al. (1997). We improve upon some of the results in that paper.

Research of the first and second authors is partially supported by RFBR grant no. 08-01-00370, Russian-Taiwan grant no. 08-06-92000. Research of the first author is partially supported by ADTP grant 2.1.1.3235.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bansal, N., Mahdian, M., Sviridenko, M.: Minimizing makespan in no-wait job shops. Math. Oper. Res. 30(4), 817–831 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Carlier, J., Pinson, E.: An algorithm for solving the job-shop problem. Management Sci. 35(2), 164–176 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, B., Potts, C., Woeginger, G.: A review of machine scheduling: complexity, algorithms and approximability. Handbook of combinatorial optimization, vol. 3, pp. 21–169. Kluwer Acad. Publ., Boston (1998)

    MATH  Google Scholar 

  4. Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(ElogD) time. Combinatorica 21, 5–12 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fischer, J., Thompson, G.: Industrial Scheduling. Prentice Hall, Englewood Cliffs (1963)

    Google Scholar 

  6. Gabow, H., Kariv, O.: Algorithms for edge coloring bipartite graphs and multigraphs. SIAM J. Comput. 11, 117–129 (1982)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Handbook of scheduling. In: Leung, J.Y.-T. (ed.) Algorithms, models, and performance analysis. Chapman & Hall/CRC Computer and Information Science Series. Chapman & Hall/CRC, Boca Raton (2004)

    Google Scholar 

  9. Hoogeveen, J., Lenstra, J., Veltman, B.: Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Lett. 16(3), 129–137 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kashyrskikh, K.N., Sevastianov, S.V., Tchernykh, I.D.: 4-parameter complexity analysis of the open shop problem (in Russian). Diskret. Analiz. i Issled. Oper. 7(4), 59–77 (2000)

    Google Scholar 

  11. Kononov, A., Sevastianov, S.: On the complexity of the connected list vertex-coloring problem (in Russian). Diskret. Analiz. i Issled. Oper. 7(2) (Ser. 1), 21–46 (2000)

    Google Scholar 

  12. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Graves, S., Rinnooy Kan, A.H.G., Zipkin, P. (eds.) Handbooks in Operations Research and Management Science. Logistics of Production and Inventory, vol. 4, pp. 445–522. North-Holland, Amsterdam (1993)

    Google Scholar 

  13. Lenstra, J., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Operations Research 26(1), 22–35 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lenstra, J., Shmoys, D., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46(3) (Ser. A), 259–271 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  15. Melnikov, L., Vizing, V.: The edge chromatic number of a directed/mixed multigraph. J. Graph Theory 31(4), 267–273 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Pyatkin, A.: Incidentor Colorings and their applications, Ph. D. Thesis (1999)

    Google Scholar 

  17. Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. In: Algorithms and Combinatorics, vol. 24, B. Springer, Berlin (2003)

    Google Scholar 

  18. Shakhlevich, N.V., Sotskov, Y.N., Werner, F.: Complexity of mixed shop scheduling problems: A survey. European Journal of Operational Research 120, 343–351 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  19. Vizing, V.: A bipartite interpretation of a directed multigraph in problems of the coloring of incidentors (Russian). Diskretn. Anal. Issled. Oper. 9(1) (Ser. 1), 27–41 (2002)

    MathSciNet  Google Scholar 

  20. Williamson, D., Hall, L., Hoogeveen, J., Hurkens, C., Lenstra, J.K., Sevastianov, S., Shmoys, D.: Short shop schedules. Oper. Res. 45(2), 288–294 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Alexander Kononov & Sergey Sevastyanov

  2. Novosibirsk State University, Novosibirsk, Russia

    Alexander Kononov & Sergey Sevastyanov

  3. IBM T.J. Watson Research Center, Yorktown Heights, USA

    Maxim Sviridenko

Authors
  1. Alexander Kononov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergey Sevastyanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maxim Sviridenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, 4 Koptyug av, 630090, Novosibirsk, Russia

    Anna Frid

  2. Sobolev Institute of Mathematics SB RAS, Koptyug av. 4, 630090, Novosibirsk, Russia

    Andrey Morozov

  3. Max Planck Institute for Software Systems, Campus E1 4, 66123, Saarbrücken, Germany

    Andrey Rybalchenko

  4. Lehrstuhl für Theoretische Informatik, Institut für Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97974, Würzburg, Germany

    Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kononov, A., Sevastyanov, S., Sviridenko, M. (2009). Complete Complexity Classification of Short Shop Scheduling. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds) Computer Science - Theory and Applications. CSR 2009. Lecture Notes in Computer Science, vol 5675. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03351-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03351-3_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03350-6

  • Online ISBN: 978-3-642-03351-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics