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 language | English |
---|---|
Pages (from-to) | 1-16 |
Number of pages | 16 |
Journal | Naval Research Logistics |
Volume | 58 |
Issue number | 1 |
DOIs | |
State | Published - Feb 2011 |
Keywords
- complexity
- multi-cyclic scheduling
- no-wait
- polynomial algorithms
- robotic scheduling
- work-in-process