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

Authors:
Nadia Brauner;Gerd Finke;Vassilissa Lehoux-Lebacque;Chris Potts;Jonathan Whitehead
Affiliations:
Laboratoire G-SCOP, 46 av. Félix Viallet, 38031 Grenoble, France;Laboratoire G-SCOP, 46 av. Félix Viallet, 38031 Grenoble, France;Laboratoire G-SCOP, 46 av. Félix Viallet, 38031 Grenoble, France;School of Mathematics, University of Southampton, Highfield, Southampton SO17 1BJ, UK;School of Mathematics, University of Southampton, Highfield, Southampton SO17 1BJ, UK
Venue:
Computers and Operations Research
Year:
2009

Citing 1
Cited 5

On the complexity of coupled-task scheduling

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems

Scheduling of coupled tasks with unit processing times

Journal of Scheduling
A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell

Computers and Operations Research
Complexity and approximation for scheduling problem for a torpedo

Computers and Industrial Engineering
A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times

Computers and Operations Research
Efficient metaheuristics for pick and place robotic systems optimization

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.01

Visualization

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.