An improved algorithm for cyclic flowshop scheduling in a robotic cell

An improved algorithm for cyclic flowshop scheduling in a robotic cell

0.00 Avg rating0 Votes
Article ID: iaor19991203
Country: Netherlands
Volume: 97
Issue: 3
Start Page Number: 500
End Page Number: 508
Publication Date: Mar 1997
Journal: European Journal of Operational Research
Authors: , ,
Keywords: flowshop
Abstract:

This paper addresses a cyclic robot scheduling problem in an automated manufacturing line in which a single robot is used to move parts from one workstation to another. The objective is to minimize the cycle length. Previously known algorithms are either heuristic or at best polynomial of the fifth degree in the number of machines, m. We derive an exact scheduling algorithm solving the problem in O(m3 log m) time.

Reviews

Required fields are marked *. Your email address will not be published.