On optimal cycles for regular balanced no-wait robotic cell problems

S. V. Pavlov

Sobolev Institute of Mathematics, Novosibirsk, Russia

Abstract: 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.

UDC: 519.854.2

Received: 20.12.2011
Revised: 04.10.2012

Bibliographic databases:

•