Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference12 articles.
1. Averbakh, I., & Berman, O. (1996). Routing two-machine flowshop problems on networks with special structure. Transportation Science, 30(4), 303–314. https://doi.org/10.1287/trsc.30.4.303
2. 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
3. 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
4. Chernykh, I., Kononov, A., & Sevastyanov, S. (2020). A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes. In: Kononov, A. et al. (eds.) Mathematical optimization theory and operations research. MOTOR 2020. Lecture Notes in Computer Science, vol. 12095, pp. 301–312. Springer. https://doi.org/10.1007/978-3-030-49988-4_21
5. Chernykh, I., Kononov, A., & Sevastyanov, S. (2018). Exact polynomial-time algorithm for the two-machine routing flow shop problem with a restricted transportation network. Optimization Problems and Their Applications (OPTA-2018), Abstracts of the VII International Conference (Omsk, Russia, July 8–14, 2018) (pp. 37–37). Omsk State University.