A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

Vladimir Kats, Eugene Levner

Research output: Contribution to journalArticlepeer-review

41 Scopus citations

Abstract

We consider the problem of cyclic scheduling of identical jobs in a re-entrant flowshop. A robot is responsible for moving each job from a machine to another. Our aim is to find a minimum length cycle of the robot's moves such that exactly one new job enters the system and exactly one completed job leaves the system during the cycle. We present a strongly polynomial algorithm for finding such a cycle.

Original languageEnglish
Pages (from-to)171-179
Number of pages9
JournalOperations Research Letters
Volume21
Issue number4
DOIs
StatePublished - Nov 1997
Externally publishedYes

Keywords

  • Cyclic scheduling
  • Optimization
  • Production/scheduling

Fingerprint

Dive into the research topics of 'A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling'. Together they form a unique fingerprint.

Cite this