TY - JOUR
T1 - A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
AU - Koganl, Konstantin
AU - Levner, Eugene
PY - 1998
Y1 - 1998
N2 - The n-job, two-machine, multi-robot flowshop scheduling problem is considered with the objective of minimizing makespan. Various transportation, setup and loading/unloading effects arising in a modern flexible manufacturing cell are modeled by a graph representation of the technological process. An algorithm of O(n2) complexity is derived to solve the problem to optimality.
AB - The n-job, two-machine, multi-robot flowshop scheduling problem is considered with the objective of minimizing makespan. Various transportation, setup and loading/unloading effects arising in a modern flexible manufacturing cell are modeled by a graph representation of the technological process. An algorithm of O(n2) complexity is derived to solve the problem to optimality.
UR - http://www.scopus.com/inward/record.url?scp=85084725527&partnerID=8YFLogxK
U2 - 10.1016/s0305-0548(98)80008-7
DO - 10.1016/s0305-0548(98)80008-7
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
SN - 0305-0548
VL - 25
SP - 53
EP - 62
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 1
ER -