Abstract
We consider a routing open shop problem being a natural generalization of the metric TSP and the classic open shop scheduling problem. The maximal possible ratio of the optimal makespan and the standard lower bound for the routing open shop has already been investigated in the last few years. The two-machine case is mostly covered. It is constructively proven in 2013 that the ratio mentioned above cannot be greater than 4/3, however, we do not know of any problem instance with the value of that ratio greater than 6/5. The latter ratio is achievable for a simplest case with two nodes. On the other hand, it is known that optimal makespan is at most 6/5 of the standard lower bound for at least a few special cases of the transportation network: one is with at most three nodes, and another is a tree.
In this paper, we introduce an ultimate instance reduction technique, which allows reducing the general problem into a case with at most four nodes and at most six jobs. As a by-product, we propose a new polynomially solvable case of the two-machine routing open shop problem.
This research was supported by the program of fundamental scientific researches of the SB RAS No I.5.1., project No 0314-2019-0014, and by the Russian Foundation for Basic Research, projects 20-01-00045 and 20-07-00458.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Averbakh, I., Berman, O., Chernykh, I.: A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. Euro. J. Oper. Res. 166(1), 3–24 (2005). https://doi.org/10.1016/j.ejor.2003.06.050
Averbakh, I., Berman, O., Chernykh, I.: The routing open-shop problem on a network: complexity and approximation. Eur. J. Oper. Res. 173(2), 531–539 (2006). https://doi.org/10.1016/j.ejor.2005.01.034
van Bevern, R., Slugina, V.A.: A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem. Hist. Math. 53, 118–127 (2020). https://doi.org/10.1016/j.hm.2020.04.003
Chernykh, I., Kononov, A.V., Sevastyanov, S.: Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40(3), 841–847 (2013). https://doi.org/10.1016/j.cor.2012.01.006
Chernykh, I., Krivonogiva, O.: Optima localization for the two-machine routing open shop on a tree (in Russian) (2021), submitted to Diskretnyj Analiz i Issledovanie Operacij
Chernykh, I., Krivonogova, O.: Efficient algorithms for the routing open shop with unrelated travel times on cacti. In: Jaćimović, M., Khachay, M., Malkova, V., Posypkin, M. (eds.) OPTIMA 2019. CCIS, vol. 1145, pp. 1–15. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-38603-0_1
Chernykh, I., Krivonogova, O.: On the optima localization for the three-machine routing open shop. In: Kononov, A., Khachay, M., Kalyagin, V.A., Pardalos, P. (eds.) MOTOR 2020. LNCS, vol. 12095, pp. 274–288. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-49988-4_19
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, Cham (2016). https://doi.org/10.1007/978-3-319-44914-2_23
Chernykh, I., Lgotina, E.: Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass. Optim. Methods Softw. (2020). https://doi.org/10.1080/10556788.2020.1734802
Chernykh, I., Pyatkin, A.: Irreducible bin packing: complexity, solvability and application to the routing open shop. In: Matsatsinis, N.F., Marinakis, Y., Pardalos, P. (eds.) LION 2019. LNCS, vol. 11968, pp. 106–120. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-38629-0_9
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)
Christofides, N.: Graph Theory: An Algorithmic Approach. Academic Press, New York (1975)
Gonzalez, T.F., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23(4), 665–679 (1976). https://doi.org/10.1145/321978.321985
Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Q. 1(1), 61–68 (1954). https://doi.org/10.1002/nav.3800010110
Serdyukov, A.: On some extremal routes on graphs (in Russian). Upravlyaemye Syst. 17, 76–79 (1978)
Sevastyanov, S.V., Chemisova, D.A., Chernykh, I.D.: Some properties of optimal schedules for the Johnson problem with preemption. J. Appl. Ind. Math. 1(3), 386–397 (2007). https://doi.org/10.1134/s1990478907030143
Sevastyanov, S.V., Chemisova, D.A., Chernykh, I.D.: On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion. Ann. Oper. Res. 213(1), 253–270 (2012). https://doi.org/10.1007/s10479-012-1290-3
Sevastianov, S.V., Tchernykh, I.D.: Computer-aided way to prove theorems in scheduling. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 502–513. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-68530-8_42
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Chernykh, I. (2021). Two-Machine Routing Open Shop: How Long Is the Optimal Makespan?. In: Pardalos, P., Khachay, M., Kazakov, A. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2021. Lecture Notes in Computer Science(), vol 12755. Springer, Cham. https://doi.org/10.1007/978-3-030-77876-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-77876-7_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-77875-0
Online ISBN: 978-3-030-77876-7
eBook Packages: Computer ScienceComputer Science (R0)