The open shop problem with routing at a two-node network and allowed preemption
- 55 Downloads
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.
Keywordsopen shop problem with routing preemption of the operations NP-completeness
Unable to display preview. Download preview PDF.
- 3.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.Google Scholar