Skip to main content
SpringerLink
Log in

Routing Open Shop with Unrelated Travel Times

  • Conference paper
  • First Online:
Discrete Optimization and Operations Research (DOOR 2016)

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

Abstract

The routing open shop problem is a generalization of scheduling open shop problem and metric TSP. The jobs are located at nodes of some transportation network while the machines travel on the network to execute the jobs in the open shop environment. The machines are initially located at the same node (the depot) and have to return to the depot after completing all the jobs. The goal is to construct a feasible schedule minimizing the makespan. The problem is known to be NP-hard even for the trivial case with two machines on a link.

We discuss the generalization of that problem in which each machine has individual travel times between the nodes of the network. For this model with two machines on a tree we suggest a linear time algorithm for a case when the depot is not predefined and has to be chosen.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Averbach, I., Berman, O., Chernykh, I.: A \(\frac{6}{5}\)-approximation algorithm for the two-machine routing open shop problem on a 2-node network. Eur. J. Oper. Res. 166(1), 3–24 (2005)

    Article  MathSciNet  Google Scholar 

  2. Averbach, I., Berman, O., Chernykh, I.: The routing open-shop problem on a network: complexity and approximation. Eur. J. Oper. Res. 173(2), 521–539 (2006)

    MathSciNet  Google Scholar 

  3. Chernykh, I., Kononov, A., Sevastyanov, S.: Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40(3), 841–847 (2013)

    Article  MathSciNet  Google Scholar 

  4. Chernykh, I., Lgotina, E.: The 2-machine routing open shop on a triangular transportation network. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 284–297. Springer, Heidelberg (2016)

    Google Scholar 

  5. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburg, PA (1976)

    Google Scholar 

  6. Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freemann and Company, San Francisco (1979)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Kononov, A.: On the two-machine routing open shop problem on a 2-node network. Discrete Anal. Oper. Res. 19(2), 54–74 (2012). (in Russian)

    MathSciNet  MATH  Google Scholar 

  9. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., Sequencing, S.: Algorithms and Complexity. In: Graves, S.C., et al. (eds.) Handbooks in Operations Research and Management Science. Logistics of Production and Inventory, vol. 4, pp. 445–522. North Holland, Amsterdam (1993)

    Google Scholar 

  10. Serdyukov, A.: On some extremal routes in graphs. Upravlyaemye Sistemy 17, 76–79 (1978). (in Russian)

    MathSciNet  MATH  Google Scholar 

  11. Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevast’janov, S.V., Shmoys, D.B.: 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

    Ilya Chernykh

  2. Novosibirsk State University, Novosibirsk, Russia

    Ilya Chernykh

Authors
  1. Ilya Chernykh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ilya Chernykh .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Yury Kochetov

  2. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  3. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Vladimir Beresnev

  4. Far Eastern Federal University , Vladivostik, Russia

    Evgeni Nurminski

  5. University of Florida , Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Chernykh, I. (2016). Routing Open Shop with Unrelated Travel Times. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. DOOR 2016. Lecture Notes in Computer Science(), vol 9869. Springer, Cham. https://doi.org/10.1007/978-3-319-44914-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44914-2_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44913-5

  • Online ISBN: 978-3-319-44914-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation