Scheduling of coupled tasks and one-machine no-wait robotic cells |
| |
Authors: | Nadia Brauner Gerd Finke Vassilissa Lehoux-Lebacque Chris Potts Jonathan Whitehead |
| |
Affiliation: | 1. Laboratoire G-SCOP, 46 av. Félix Viallet, 38031 Grenoble, France;2. School of Mathematics, University of Southampton, Highfield, Southampton SO17 1BJ, UK |
| |
Abstract: | Coupled task scheduling problems have been known for more than 25 years. Several complexity results have been established in the meantime, but the status of the identical task case remains still unsettled. We describe a new class of equivalent one-machine no-wait robotic cell problems. It turns out that scheduling of identical coupled tasks corresponds to the production of a single part type in the robotic cell. We shall describe new algorithmic procedures to solve this robotic cell problem, allowing lower and upper bounds on the production time and discussing in particular cyclic production plans. |
| |
Keywords: | Coupled tasks Robotic cells Cyclic production |
本文献已被 ScienceDirect 等数据库收录! |
|