Skip to main content
Article thumbnail
Location of Repository

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

By Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Chris Potts and Jonathan David Whitehead

Abstract

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

Topics: QA
Year: 2009
OAI identifier: oai:eprints.soton.ac.uk:149855
Provided by: e-Prints Soton

Suggested articles

Citations

  1. (1978). A characterization of the minimum cycle mean in a digraph. Discrete Mathematics doi
  2. (2004). An exact algorithm for scheduling identical coupled tasks. doi
  3. (1996). Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags. doi
  4. Heuristics for a coupled-operation scheduling problem. doi
  5. (1997). On the Complexity of Coupled-task Scheduling. Discrete Applied Mathematics doi
  6. (1980). Scheduling coupled tasks. Naval Research Logistics Quarterly doi
  7. (1996). Scheduling for a multifunction phased array radar system. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.