Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels |
| |
| Authors: | Ada Che Vladimir Kats Eugene Levner |
| |
| Affiliation: | 1. School of Management, Northwestern Polytechnical University, Xi'an, People's Republic of China;2. Institute for Industrial Mathematics, Beer‐Sheva, Israel;3. Holon Institute of Technology, Holon and Bar‐Ilan University, Ramat Gan, Israel |
| |
| 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 |
| |
| Keywords: | robotic scheduling multi‐cyclic scheduling work‐in‐process polynomial algorithms complexity no‐wait |
|
|
