Abstract
The open shop problem with routing and allowed preemption is a generalization of the two classical discrete optimization problems: the NP-hard metrical traveling salesman problem and the polynomially solvable scheduling problem, i.e., the open shop with allowed preemption. In the paper, a partial case of this problem is considered when the transportation network consists of two nodes. It is proved that the problem with two machines is polynomially solvable, while the problem is NP-hard in the strong sense in the case of not fixed number of machines.
Similar content being viewed by others
References
I. Averbakh, O. Berman, and I. Chernykh, “A \(\tfrac{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).
I. Averbakh, O. Berman, and I. Chernykh, “The Routing Open-Shop Problem on a Network: Complexity and Approximation,” European J. Oper. Res. 173(2), 531–539 (2006).
I. Chernykh, N. Dryuck, A. Kononov, and S. Sevastyanov, “The Routing Open Shop Problem: New Approximation Algorithms,” in Approximation and Online Algorithms: 7th International Workshop WAOA 2009 (Copenhagen, Denmark, September 10–11, 2009). Revised Papers (Berlin, Springer, 2010), pp.75–85.
T. Gonzalez and S. Sahni, “Open Shop Scheduling to Minimize Finish Time,” J. ACM 23(4), 665–679 (1976).
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and G. B. Shmoys, “Sequencing and Scheduling: Algorithms and Complexity,” in Logistics of Production and Inventory (Elsevier, Amsterdam, 1993), pp. 445–522.
D. P. Williamson, L. A. Hall, J. A. Hoogeveen, C. A. J. Hurkens, J. K. Lenstra, S. V. Sevastianov, and D. B. Shmoys, “Short Shop Schedules,” Oper. Res. 45(2), 288–294 (1997).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.V. Pyatkin, I.D. Chernykh, 2012, published in Diskretnyi Analiz i Issledovanie Operatsii, 2012, Vol. 19, No. 3, pp. 65–79.
Rights and permissions
About this article
Cite this article
Pyatkin, A.V., Chernykh, I.D. The open shop problem with routing at a two-node network and allowed preemption. J. Appl. Ind. Math. 6, 346–354 (2012). https://doi.org/10.1134/S199047891203009X
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S199047891203009X