DocumentCode
3152613
Title
Studies on 2-cyclic robotic scheduling
Author
Sáez, Pablo
Author_Institution
Calle Nueva 3 Población Versalles, San Pedro de la Paz - Concepción, Chile
fYear
2009
fDate
6-9 July 2009
Firstpage
149
Lastpage
152
Abstract
We elaborate in this article on a quadratic algorithm for a particular case of the 2-cyclic robotic scheduling problem, namely the case when at most two parts go through the production line at all times; or, what is the same, when the lifetime of the part is shorter than the duration of the cycle. This study is relevant since for the general case the best known algorithms are quintic.
Keywords
industrial robots; scheduling; 2-cyclic robotic scheduling; production line; quadratic algorithm; Job shop scheduling; Manufacturing automation; Manufacturing processes; Polynomials; Printed circuits; Production; Robotics and automation; Scheduling algorithm; Service robots; Throughput; automated manufacturing process optimization; k-cyclic robotic scheduling; polynomial algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers & Industrial Engineering, 2009. CIE 2009. International Conference on
Conference_Location
Troyes
Print_ISBN
978-1-4244-4135-8
Electronic_ISBN
978-1-4244-4136-5
Type
conf
DOI
10.1109/ICCIE.2009.5223737
Filename
5223737
Link To Document