|
Diskretnyi Analiz i Issledovanie Operatsii, 2012, Volume 19, Issue 2, Pages 54–74
(Mi da682)
|
|
|
|
This article is cited in 15 scientific papers (total in 15 papers)
On a two-machine routing open shop problem on a two-node network
A. V. Kononovab a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
We consider the two-machine routing open shop problem on a two-node network. The problem is ordinary NP-hard. We present an exact pseudo-polynomial algorithm and a fully polynomial time approximation scheme for the considered problem. We also point out new polynomially solvable subproblems. Ill. 6, tab. 1, bibliogr. 8.
Keywords:
open shop, routing, fully-polynomial time approximation scheme.
Received: 09.06.2011 Revised: 24.11.2011
Citation:
A. V. Kononov, “On a two-machine routing open shop problem on a two-node network”, Diskretn. Anal. Issled. Oper., 19:2 (2012), 54–74; J. Appl. Industr. Math., 6:3 (2012), 318–331
Linking options:
https://www.mathnet.ru/eng/da682 https://www.mathnet.ru/eng/da/v19/i2/p54
|
|