论文信息 - On the routing open shop problem with two machines on a two-vertex network

On the routing open shop problem with two machines on a two-vertex network

The open shop problem is under study with two machines and routing on a two-vertex network. This problem is NP-hard. We introduce an exact pseudopolynomial algorithm, propose a fully polynomial time approximation scheme for solving this problem, and consider some particular polynomially solvable cases.

A. V. Kononov

[1] Teofilo F. Gonzalez,et al. Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[2] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[3] Alexander V. Kononov,et al. The Routing Open Shop Problem: New Approximation Algorithms , 2009, WAOA.

[4] Oded Berman,et al. The routing open-shop problem on a network: Complexity and approximation , 2006, Eur. J. Oper. Res..

[5] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .

[6] Oded Berman,et al. A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network , 2005, Eur. J. Oper. Res..