Abstract
The two-machine open shop problem was proved to be solvable in linear time by Teofilo Gonzalez and Sartaj Sahni in 1976. Several algorithms for solving that problem have been proposed since that time. We introduce another optimal algorithm for that classical problem with an interesting property: it allows to process jobs in almost arbitrary order, unlike the Gohzalez–Sahni algorithm where jobs have to be partitioned into two specific subsets. This new algorithm in turn helps us to solve a much more general problem: the easy-TSP version of the routing open shop with a variable depot, in which unmovable jobs are located in the nodes of a transportation network (with optimal route known), and mobile machines have to travel between the nodes to process jobs in the open shop environment. The common initial location of the machines is not fixed but has to be chosen, and all machines have to return to that location—the depot—to minimize finish time. We also consider the generalization of this problem in which travel times are individual for each machine. This contributes to the discussion on the differences between different scheduling models with transportation delays: classic transportation delays (in our terms, with no depot at all), with a variable depot, and with a fixed depot. It turns out that the depot makes the difference and makes the problem harder to solve.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Averbakh, I., & Berman, O. (1999). A simple heuristic for \(m\)-machine flow-shop and its applications in routing-scheduling problems. Operations Research, 47(1), 165–170. https://doi.org/10.1287/opre.47.1.165.
Averbakh, I., Berman, O., & Chernykh, I. (2005). A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. European Journal of Operational Research, 166(1), 3–24. https://doi.org/10.1016/j.ejor.2003.06.050.
Averbakh, I., Berman, O., & Chernykh, I. (2006). The routing open-shop problem on a network: complexity and approximation. European Journal of Operational Research, 173(2), 531–539. https://doi.org/10.1016/j.ejor.2005.01.034.
Brucker, P.: Scheduling algorithms. Springer-Verlag Berlin Heidelberg (2007). https://doi.org/10.1007/978-3-540-69516-5
Brucker, P., Knust, S., Edwin Cheng, T., & Shakhlevich, N. (2004). Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Annals of Operations Research, 129, 81–106. https://doi.org/10.1023/b:anor.0000030683.64615.c8.
Chernykh, I.: Routing open shop with unrelated travel times. In: Discrete Optimization and Operations Research — 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings, pp. 272–283 (2016). https://doi.org/10.1007/978-3-319-44914-2_22
Chernykh, I., Kononov, A. V., & Sevastyanov, S. (2013). Efficient approximation algorithms for the routing open shop problem. Computers & OR, 40(3), 841–847. https://doi.org/10.1016/j.cor.2012.01.006.
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)
de Werra, D.: Graph-theoretical models for preemptive scheduling. Advances in Project Scheduling pp. 171–185 (1989). http://infoscience.epfl.ch/record/88562
Esswein, C., Billaut, J. C., & Strusevich, V. A. (2005). Two-machine shop scheduling: compromise between flexibility and makespan value. European Journal of Operational Research, 167(3), 796–809. https://doi.org/10.1016/j.ejor.2004.01.029.
Golovachev, M., Pyatkin, A.V.: Routing open shop with two nodes, unit processing times and equal number of jobs and machines. In: M. Khachay, Y. Kochetov, P. Pardalos (eds.) Mathematical Optimization Theory and Operations Research, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019, Proceedings, Lecture Notes in Computer Science, vol. 11548, pp. 264–276 (2019). https://doi.org/10.1007/978-3-030-22629-9_19
Gonzalez, T. F., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of ACM, 23(4), 665–679. https://doi.org/10.1145/321978.321985.
Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Rand Corporation (1953). https://www.rand.org/pubs/papers/P402.html
Kleinau, U. (1993). Two-machine shop scheduling problems with batch processing. Mathematical and Computer Modelling, 17(6), 55–66. https://doi.org/10.1016/0895-7177(93)90196-6.
Kononov, A. (2012). On the routing open shop problem with two machines on a two-vertex network. Journal of Applied and Industrial Mathematics, 6(3), 318–331. https://doi.org/10.1134/s1990478912030064.
Kononov, A. (2015). \(O(\log m)\)-approximation for the routing open shop problem. RAIRO-Operations Research, 49, 383–391. https://doi.org/10.1051/ro/2014051.
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Chapter 9. Sequencing and scheduling: Algorithms and complexity. In: Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, vol. 4, pp. 445–522. Elsevier (1993). https://doi.org/10.1016/S0927-0507(05)80189-6
Pinedo, M., Schrage, L.: Stochastic shop scheduling: a survey. In: M.A.H. Dempster, J.K. Lenstra, A.H.G. Rinnooy Kan (eds.) Deterministic and stochastic scheduling, NATO Advanced Study Institute Series, vol. 84, pp. 181–196. Springer, Dordrecht (1982). https://doi.org/10.1007/978-94-009-7801-0_9
Serdyukov, A. (1978). On some extremal routes in graphs (in russian). Upravlyaemye Sistemy, 17, 76–79.
Sevastyanov, S. V. (2019). Some positive news on the proportionate open shop problem. Sibirskie Elektronnye Matematicheskie Izvestiya, 16, 406–426. https://doi.org/10.33048/semi.2019.16.023.
Soper, A. J. (2015). A cyclical search for the two machine flow shop and open shop to minimise finishing time. Journal of Scheduling, 18(3), 311–314. https://doi.org/10.1007/s10951-013-0356-7.
van Bevern, R., Pyatkin, A.V.: Completing partial schedules for open shop with unit processing times and routing. In: Proceedings of the 11th International Computer Science Symposium in Russia (CSR-16). Lecture Notes in Computer Science, vol. 9691, pp. 73–87 (2016). https://doi.org/10.1007/978-3-319-34171-2_6
van Bevern, R., Pyatkin, A. V., & Sevastyanov, S. V. (2019). An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times. Siberian Electronic Mathematical Reports, 16, 42–84. https://doi.org/10.33048/semi.2019.16.003.
Williamson, D. P., Hall, L. A., Hoogeveen, J. A., Hurkens, C. A. J., Lenstra, J. K., Sevast’janov, S. V., et al. (1997). Short shop schedules. Operations Research, 45(2), 288–294. https://doi.org/10.1287/opre.45.2.288.
Yu, V. F., Lin, S., & Chou, S. (2010). The museum visitor routing problem. Applied Mathematics and Computation, 216(3), 719–729. https://doi.org/10.1016/j.amc.2010.01.066.
Acknowledgements
We would like to thank our anonymous reviewers whose constructive remarks helped to eliminate some inaccuracy committed in the paper. We would also like to thank Vitaly Strusevich for the introduction of de Werra’s and Soper’s algorithms to us and for valuable comments that contributed to the quality of the presentation.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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, project 20-01-00045.
Rights and permissions
About this article
Cite this article
Khramova, A.P., Chernykh, I. A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing. J Sched 24, 405–412 (2021). https://doi.org/10.1007/s10951-021-00694-7
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-021-00694-7