Scheduling of coupled tasks and one-machine no-wait robotic cells

N Brauner, G Finke, V Lehoux-Lebacque… - Computers & Operations …, 2009 - Elsevier
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 …

Scheduling of coupled tasks and one-machine no-wait robotic cells

N Brauner, G Finke, V Lebacque, C Potts… - IFAC Proceedings …, 2006 - Elsevier
Coupled task scheduling problems are known since 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 1-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 …
Showing the best results for this search. See all results