Skip to main content
SpringerLink
Log in

On a Routing Open Shop Problem on Two Nodes with Unit Processing Times

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

The Routing Open Shop Problem deals with \(n \) jobs located in the nodes of an edge-weighted graph \(G=(V,E) \) and \(m \) machines that are initially in a special node calleddepot. The machines must process all jobs in arbitrary order so that each machine processes at most one job at any one time and each job is processed by at most one machine at any one time. The goal is to minimize the makespan; i.e., the time when the last machine returns to the depot. This problem is known to be NP-hard even for the two machines and the graph containing only two nodes. In this article we consider the particular case of the problem with a \(2\)-node graph, unit processing time of each job, and unit travel time between every two nodes. The conjecture is made that the problem is polynomially solvable in this case; i.e., the makespan depends only on the number of machines and the loads of the nodes and can be calculated in time \(O(\log mn) \). We provide some new bounds on the makespan in the case of \(m = n \) depending on the loads distribution.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. T. Gonzalez and S. Sahni, “Open Shop Scheduling to Minimize Finish Time,” J. ACM. 23 (4), 665–679 (1976).

    Article  MathSciNet  Google Scholar 

  2. D. P. Williamson, L. A. Hall, J. A. Hoogeveen, C. A. J. Hurkens, J. K. Lenstra, S. V. Sevast’janov, and D. B. Shmoys, “Short Shop Schedules,” Oper. Res.45, 288–294 (1997).

    Article  MathSciNet  Google Scholar 

  3. R. Cole, K. Ost, and S. Schirra, “Edge-Coloring Bipartite Multigraphs in \(O(E\times \log {D})\) Time,” Combinatorica 21 (1), 5–12 (2001).

    Article  MathSciNet  Google Scholar 

  4. I. Averbakh, O. Berman, and I. Chernykh, “A \(6/5 \)-Approximation Algorithm for the Two-Machine Routing Open Shop Problem on a \(2\)-Node Network,” European J. Oper. Res. 166 (1), 3–24 (2005).

    Article  MathSciNet  Google Scholar 

  5. I. Averbakh, O. Berman, and I. Chernykh, “The Routing Open-Shop Problem on a Network: Complexity and Approximation,” European J. Oper. Res. 173 (2), 521–539 (2006).

    Article  MathSciNet  Google Scholar 

  6. A. V. Kononov, “On the Routing Open Shop Problem with Two Machines on a Two-Vertex Network,” Diskret. Anal. Issled. Oper. 19 (2), 54–74 (2012) [J. Appl. Ind. Math. 6, 318–331 (2012)].

    Article  MathSciNet  Google Scholar 

  7. A. V. Pyatkin and I. D. Chernykh, “The Open Shop Problem with Routing at a Two-Node Network and Allowed Preemption,” Diskret. Anal. Issled. Oper. 19 (3), 65–78 (2012) [J. Appl. Ind. Math. 6 (3), 346–354 (2012)].

    Article  MathSciNet  Google Scholar 

  8. R. Van Bevern and A. V. Pyatkin, “Completing Partial Schedules for Open Shop with Unit Processing Times and Routing,” in Computer Science—Theory and Applications: Proceedings of 11th International Computer Science Symposium in Russia (St. Petersburg, Russia, June 9–13, 2016) (Springer, Cham, 2016), pp. 73–87.

  9. R. Van Bevern, A. V. Pyatkin, and S. V. Sevastyanov, “An Algorithm with Parameterized Complexity of Constructing the Optimal Schedule for the Routing Open Shop Problem with Unit Execution Times,” Sibirean Electron. Math. Rep. 16, 42–84 (2019).

    MathSciNet  MATH  Google Scholar 

  10. P. Brucker, S. Knust, T. C. E. Cheng, and N. V. Shakhlevich, “Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays,” Ann. Oper. Res. 129, 81–106 (2004).

    Article  MathSciNet  Google Scholar 

  11. I. Lushchakova, A. Soper, and V. Strusevich, “Transporting Jobs through a Two-Machine Open Shop,” Naval Res. Logistics 56, 1–18 (2009).

    Article  MathSciNet  Google Scholar 

  12. V. Strusevich, “A Heuristic for the Two-Machine Open-Shop Scheduling Problem with Transportation Times,” Discrete Appl. Math. 93 (2), 287–304 (1999).

    Article  MathSciNet  Google Scholar 

  13. M. O. Golovachev and A. V. Pyatkin, “Routing Open Shop with Two Nodes, Unit Processing Times, and Equal Number of Jobs and Machines,” in Mathematical Optimization Theory and Operations Research:Proceedings of 18th International Conference (Ekaterinburg, Russia, July 8–12, 2019) (Springer, Cham, 2019), pp. 264–276.

  14. H. Bräsel, D. Kluge, and F. Werner, “A Polynomial Algorithm for the \([n/m/0 \), \(t_{ij}=1, \text {Tree/C}_{\max }]\) Open Shop Problem,” European J. Oper. Res.72 (1), 125–134 (1994).

    Article  Google Scholar 

  15. R. Diestel, Graph Theory (Springer, Heidelberg, 2016).

    MATH  Google Scholar 

Download references

Funding

The authors were supported by the Program of Basic Research of the Siberian Branch of the Russian Academy of Sciences (project no. 0314–2019–0014) and the Russian Foundation for Basic Research (project no. 20–01–00045).

Author information

Authors and Affiliations

  1. Novosibirsk State University, Novosibirsk, 630090, Russia

    M. O. Golovachev & A. V. Pyatkin

  2. Sobolev Institute of Mathematics, Novosibirsk, 630090, Russia

    A. V. Pyatkin

Authors
  1. M. O. Golovachev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Pyatkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to M. O. Golovachev or A. V. Pyatkin.

Additional information

Translated by G.A. Chumakov

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Golovachev, M.O., Pyatkin, A.V. On a Routing Open Shop Problem on Two Nodes with Unit Processing Times. J. Appl. Ind. Math. 14, 470–479 (2020). https://doi.org/10.1134/S1990478920030060

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478920030060

Keywords

Search

Navigation