Coupled task scheduling problems were first studied more<br/>than 25 years ago. Several complexity results have been<br/>established in the meantime, but the status of the identical task case still remains 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 a robotic cell. We 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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.