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

Authors


  • A preliminary version of this work was partially presented at the IASTED Conference MSI-2009, Beijing.

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. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011

Ancillary