Geodesic
Preemptive routing open shop on a~link
Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 3, pp. 65-78

Voir la notice de l'article provenant de la source Math-Net.Ru

Preemptive routing open shop problem is a generalization of two classic discrete optimization problems: NP-hard metric TSP and polynomially solvable open shop scheduling problem. We show that the problem with two machines is polynomially solvable while in case when the number of machines is a part of an input the problem is strongly NP-hard. Ill. 6, bibliogr. 6.
Keywords: routing open shop, preemption, NP-completeness. 
@article{DA_2012_19_3_a5,
     author = {A. V. Pyatkin and I. D. Chernykh},
     title = {Preemptive routing open shop on a~link},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {65--78},
     publisher = {mathdoc},
     volume = {19},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2012_19_3_a5/}
}
TY  - JOUR
AU  - A. V. Pyatkin
AU  - I. D. Chernykh
TI  - Preemptive routing open shop on a~link
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2012
SP  - 65
EP  - 78
VL  - 19
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2012_19_3_a5/
LA  - ru
ID  - DA_2012_19_3_a5
ER  - 
%0 Journal Article
%A A. V. Pyatkin
%A I. D. Chernykh
%T Preemptive routing open shop on a~link
%J Diskretnyj analiz i issledovanie operacij
%D 2012
%P 65-78
%V 19
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2012_19_3_a5/
%G ru
%F DA_2012_19_3_a5
A. V. Pyatkin; I. D. Chernykh. Preemptive routing open shop on a~link. Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 3, pp. 65-78. http://geodesic.mathdoc.fr/item/DA_2012_19_3_a5/