Geodesic
On optimal cycles for regular balanced no-wait robotic cell problems
Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 1, pp. 45-57

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

The problem of finding optimal cyclic schedules for a regular balanced no-wait flow shop robotic cell with one robot is considered. The optimality criterium is the maximum of the throughput. Identical jobs require equal amounts of time on different machines of the robotic cell. All possible cycles are analyzed, and the optimal solution for the problem with 5 machines is found. The solution confirms the already known hypotheses about the structure of the optimal solutions. Tab. 1, ill. 2, bibliogr. 9.
Keywords: robotic cell, cyclic schedule, Agnetis conjecture. 
@article{DA_2013_20_1_a4,
     author = {S. V. Pavlov},
     title = {On optimal cycles for regular balanced no-wait robotic cell problems},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {45--57},
     publisher = {mathdoc},
     volume = {20},
     number = {1},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2013_20_1_a4/}
}
TY  - JOUR
AU  - S. V. Pavlov
TI  - On optimal cycles for regular balanced no-wait robotic cell problems
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2013
SP  - 45
EP  - 57
VL  - 20
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2013_20_1_a4/
LA  - ru
ID  - DA_2013_20_1_a4
ER  - 
%0 Journal Article
%A S. V. Pavlov
%T On optimal cycles for regular balanced no-wait robotic cell problems
%J Diskretnyj analiz i issledovanie operacij
%D 2013
%P 45-57
%V 20
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2013_20_1_a4/
%G ru
%F DA_2013_20_1_a4
S. V. Pavlov. On optimal cycles for regular balanced no-wait robotic cell problems. Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 1, pp. 45-57. http://geodesic.mathdoc.fr/item/DA_2013_20_1_a4/