Geodesic
Construction of cyclic schedules in presence of parallel machines
Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 1, pp. 5-20

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

We consider the problem of processing some identical jobs with a complicated technological route on some production line in presence of parallel machines. Under some constraints on the number of jobs processed simultaneously, a cyclic schedule is desired with minimum cycle duration. Some algorithm for construction of an exact solution is proposed and substantiated. Also, we found the case of pseudopolynomially solvable problem. Illustr. 4, bibliogr. 16.
Keywords: cyclic schedule, dynamic programming
Mots-clés : pseudopolynomial algorithm. 
@article{DA_2017_24_1_a0,
     author = {E. A. Bobrova and V. V. Servakh},
     title = {Construction of cyclic schedules in presence of parallel machines},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {5--20},
     publisher = {mathdoc},
     volume = {24},
     number = {1},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2017_24_1_a0/}
}
TY  - JOUR
AU  - E. A. Bobrova
AU  - V. V. Servakh
TI  - Construction of cyclic schedules in presence of parallel machines
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2017
SP  - 5
EP  - 20
VL  - 24
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2017_24_1_a0/
LA  - ru
ID  - DA_2017_24_1_a0
ER  - 
%0 Journal Article
%A E. A. Bobrova
%A V. V. Servakh
%T Construction of cyclic schedules in presence of parallel machines
%J Diskretnyj analiz i issledovanie operacij
%D 2017
%P 5-20
%V 24
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2017_24_1_a0/
%G ru
%F DA_2017_24_1_a0
E. A. Bobrova; V. V. Servakh. Construction of cyclic schedules in presence of parallel machines. Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 1, pp. 5-20. http://geodesic.mathdoc.fr/item/DA_2017_24_1_a0/