Geodesic
The complexity of cyclic scheduling for identical jobs
Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 4, pp. 3-14

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

We consider the Cyclic Job Shop Problem for identical jobs with the criterion for cycle time minimization when the number of simultaneously processed tasks during the cycle time is limited by a constant $H$. We prove that this problem is NP-hard in the case $H\ge4$. For the case $H=2$, we propose an exact polynomial algorithm. Ill. 7, bibliogr. 16.
Keywords: identical tasks, cyclic scheduling. 
@article{DA_2013_20_4_a0,
     author = {E. A. Bobrova and A. A. Romanova and V. V. Servakh},
     title = {The complexity of cyclic scheduling for identical jobs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--14},
     publisher = {mathdoc},
     volume = {20},
     number = {4},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2013_20_4_a0/}
}
TY  - JOUR
AU  - E. A. Bobrova
AU  - A. A. Romanova
AU  - V. V. Servakh
TI  - The complexity of cyclic scheduling for identical jobs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2013
SP  - 3
EP  - 14
VL  - 20
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2013_20_4_a0/
LA  - ru
ID  - DA_2013_20_4_a0
ER  - 
%0 Journal Article
%A E. A. Bobrova
%A A. A. Romanova
%A V. V. Servakh
%T The complexity of cyclic scheduling for identical jobs
%J Diskretnyj analiz i issledovanie operacij
%D 2013
%P 3-14
%V 20
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2013_20_4_a0/
%G ru
%F DA_2013_20_4_a0
E. A. Bobrova; A. A. Romanova; V. V. Servakh. The complexity of cyclic scheduling for identical jobs. Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 4, pp. 3-14. http://geodesic.mathdoc.fr/item/DA_2013_20_4_a0/