TY - JOUR
T1 - Minimizing the number of robots to meet a given cyclic schedule
AU - Kats, Vladimir
AU - Levner, Eugene
PY - 1997
Y1 - 1997
N2 - We study a problem of cyclic no-wait scheduling of identical parts on m sequential machines. A number of robots are used to transport the parts from one machine to another. We consider the problem that has two performance measures: one is the number of robots to be used, the other is the period of a cyclic schedule. We find the minimal number of robots needed to meet a given cyclic schedule, for all possible cycle lengths, the complexity of the suggested algorithm bang O(m5), independently of the range within which the cycle length value may vary.
AB - We study a problem of cyclic no-wait scheduling of identical parts on m sequential machines. A number of robots are used to transport the parts from one machine to another. We consider the problem that has two performance measures: one is the number of robots to be used, the other is the period of a cyclic schedule. We find the minimal number of robots needed to meet a given cyclic schedule, for all possible cycle lengths, the complexity of the suggested algorithm bang O(m5), independently of the range within which the cycle length value may vary.
KW - Assignment problem
KW - Cyclic scheduling
KW - Polynomial algorithm
KW - Robotic scheduling
UR - http://www.scopus.com/inward/record.url?scp=0031540827&partnerID=8YFLogxK
U2 - 10.1023/a:1018980928352
DO - 10.1023/a:1018980928352
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0031540827
SN - 0254-5330
VL - 69
SP - 209
EP - 226
JO - Annals of Operations Research
JF - Annals of Operations Research
ER -