An improved algorithm for cyclic flowshop scheduling in a robotic cell

Eugene Levner, Vladimir Kats, Vadim E. Levit

Research output: Contribution to journalArticlepeer-review

97 Scopus citations

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.

Original languageEnglish
Pages (from-to)500-508
Number of pages9
JournalEuropean Journal of Operational Research
Volume97
Issue number3
DOIs
StatePublished - 16 Mar 1997
Externally publishedYes

Keywords

  • Complexity
  • Cyclic scheduling
  • Minimal cycle
  • Transporting robot

Fingerprint

Dive into the research topics of 'An improved algorithm for cyclic flowshop scheduling in a robotic cell'. Together they form a unique fingerprint.

Cite this