Skip to main content
SpringerLink
Log in

The 2-Machine Routing Open Shop on a Triangular Transportation Network

  • 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 two machine routing open shop being a generalization of the metric TSP and two machine open shop scheduling problem is considered. It is known to be NP-hard even for the simplest case when the transportation network consists of two nodes only. For that simplest case it is known that the optimal makespan for any instance belongs to interval \([\bar{R},\frac{6}{5}\bar{R}]\), there \(\bar{R}\) is the standard lower bound. We generalize that classic result to the case of three-nodes transportation network and present a linear time \(\frac{6}{5}\)-approximation algorithm for that case.

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. Averbakh, 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)

    Article  MathSciNet  MATH  Google Scholar 

  2. Averbakh, I., Berman, O., Chernykh, I.: A 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  MATH  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., Kuzevanov, M.: Sufficient condition of polynomial solvability of two-machine routing open shop with preemption allowed. Intellektual’nye sistemy 17(1–4), 552–556 (2013). (in Russian)

    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. Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach. 23, 665–679 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kononov, A.V.: On the routing open shop problem with two machines on a two-vertex network. J. Appl. Ind. Math. 6(3), 318–331 (2012). ISSN: 1990–4789

    Article  MathSciNet  MATH  Google Scholar 

  8. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, G.B.: Sequencing and scheduling: algorithms and complexity. In: Logistics of Production and Inventory, pp. 445–452. Elsevier, Amsterdam (1993)

    Google Scholar 

  9. Pyatkin, A.V., Chernykh, I.D.: The open shop problem with routing at a two-node network and allowed preemption. J. Appl. Ind. Math. 6(3), 346–354 (2012). ISSN: 1990–4789

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  11. Sevastianov, S.V., Tchernykh, I.D.: Computer-aided way to prove theorems in scheduling. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 502–513. Springer, Heidelberg (1998)

    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 & Ekaterina Lgotina

Authors
  1. Ilya Chernykh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ekaterina Lgotina
    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., Lgotina, E. (2016). The 2-Machine Routing Open Shop on a Triangular Transportation Network. 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_23

Download citation

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

  • 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