Cyclic scheduling in robotic flowshops with bounded work-in-process levels

Ada Che, Vladimir Kats, Eugene Levner

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

This study addresses cyclic scheduling in robotic flowshops with bounded work-in-process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2-cyclic robotic flowshop scheduling problems for various WIP levels.

Original languageEnglish
Pages (from-to)1-16
Number of pages16
JournalNaval Research Logistics
Volume58
Issue number1
DOIs
StatePublished - Feb 2011

Keywords

  • complexity
  • multi-cyclic scheduling
  • no-wait
  • polynomial algorithms
  • robotic scheduling
  • work-in-process

Fingerprint

Dive into the research topics of 'Cyclic scheduling in robotic flowshops with bounded work-in-process levels'. Together they form a unique fingerprint.

Cite this