Complexity of one-cycle robotic flow-shops

DOI10.1023/A:1024008726557zbMath1027.90028OpenAlexW1485398007MaRDI QIDQ1404271

Gerd Finke, Nadia Brauner, Wiesław X. Kubiak

Publication date: 21 August 2003

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024008726557

zbMATH Keywords

robotic cellsTSP problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization ⋮ Sequencing and scheduling in robotic cells: recent developments ⋮ Parametric algorithms for 2-cyclic robot scheduling with interval processing times ⋮ Identical part production in cyclic robotic cells: Concepts, overview and open questions ⋮ Multiplicity and complexity issues in contemporary production scheduling ⋮ Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells ⋮ Throughput optimization in robotic cells with input and output machine buffers: a comparative study of two key models ⋮ Transporting jobs through a two‐machine open shop ⋮ A framework for the complexity of high-multiplicity scheduling problems

This page was built for publication: Complexity of one-cycle robotic flow-shops