A linear time approximation algorithm for movement minimization in conveyor flow shop processing

DOI10.1016/j.ejor.2003.07.011zbMath1067.90138OpenAlexW2002946439MaRDI QIDQ1887913

W. Espelage, Egon Wanke

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.07.011

zbMATH Keywords

Approximation algorithmsProblem complexityMovement optimization control

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Storage controlled pile-up systems, theoretical foundations
• Scheduling in robotic cells: Complexity and steady state analysis
• Performance approximation of pick-to-belt orderpicking systems
• Movement minimization for unit distances in conveyor flow shop processing
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• Unit Execution Time Shop Problems

This page was built for publication: A linear time approximation algorithm for movement minimization in conveyor flow shop processing