Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines

  • Mikhail Golovachev
  • Artem V. PyatkinEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11548)


In the Routing Open Shop problem n jobs are located in the nodes of an edge-weighted graph \(G=(V,E)\) and m machines must process all jobs in such a way that each machine processes only one job at a time and each job is processed by only one machine at a time. The goal is to minimize the makespan, i. e. the time when the last machine comes back to the initial node called a depot (at the beginning all machines are in the depot). This problem is NP-hard even when the graph contains only two nodes. In this paper we consider the case of \(G=K_2\) when all processing times and travel times are unit. We pose the conjecture that the problem is polynomially solvable in this case, i. e. that 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 bounds on the makespan for the case of \(m=n\) depending on the loads distribution.


Routing Open Shop Unit processing times Complexity Scheduling Polynomial time Makespan bounds 


  1. 1.
    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, 3–24 (2005). Scholar
  2. 2.
    Averbakh, I., Berman, O., Chernykh, I.: The routing open-shop problem on a network: complexity and approximation. Eur. J. Oper. Res. 173, 531–539 (2006). Scholar
  3. 3.
    van Bevern, R., Pyatkin, A.V.: Completing partial schedules for open shop with unit processing times and routing. In: Kulikov, A.S., Woeginger, G.J. (eds.) CSR 2016. LNCS, vol. 9691, pp. 73–87. Springer, Cham (2016). Scholar
  4. 4.
    van Bevern, R., Pyatkin, A.V., Sevastyanov, S.V.: An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times. Siberian Electron. Math. Rep. 16, 42–84 (2019). Scholar
  5. 5.
    Bräsel, H., Kluge, D., Werner, F.: A polynomial algorithm for the \([n/m/0, t_{ij} =1, tree/cmax]\) open shop problem. Eur. J. Oper. Res. 72, 125–134 (1994). Scholar
  6. 6.
    Brucker, P., Knust, S., Cheng, T.C.E., Shakhlevich, N.V.: Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Ann. Oper. Res. 129, 81–106 (2004). Scholar
  7. 7.
    Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time. Combinatorica 21, 5–12 (2001). Scholar
  8. 8.
    Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23, 665–679 (1976). Scholar
  9. 9.
    Kononov, A.V.: On the routing open shop problem with two machines on a two-vertex network. J. Appl. Ind. Math. 6, 318–331 (2012). Scholar
  10. 10.
    Leung, J.Y. (ed.): Handbook of Scheduling - Algorithms, Models, and Performance Analysis. Chapman and Hall/CRC (2004).
  11. 11.
    Lushchakova, I., Soper, A., Strusevich, V.: Transporting jobs through a two-machine open shop. Naval Res. Logist. 56, 1–18 (2009). Scholar
  12. 12.
    Pyatkin, A.V., Chernykh, I.D.: The open shop problem with routing at a two-node network and allowed preemption. J. Appl. Indust. Math. 6, 346–354 (2012). Scholar
  13. 13.
    Strusevich, V.: A heuristic for the two-machine open-shop scheduling problem with transportation times. Discrete Appl. Math. 93(2), 287–304 (1999). Scholar
  14. 14.
    Williamson, D.P., et al.: Short shop schedules. Oper. Res. 45, 288–294 (1997). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Sobolev Institute of MathematicsNovosibirskRussia
  2. 2.Novosibirsk State UniversityNovosibirskRussia

Personalised recommendations