Movement minimization for unit distances in conveyor flow shop processing

DOI10.1007/S001860200249zbMath1023.90025OpenAlexW2140238454MaRDI QIDQ1395369

W. Espelage, Egon Wanke

Publication date: 26 June 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860200249

zbMATH Keywords

approximation algorithmNP-completeness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (1)

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

This page was built for publication: Movement minimization for unit distances in conveyor flow shop processing