An approximate algorithm for the three-machine problem

zbMath0597.90046MaRDI QIDQ1079490

A. V. Panishev, S. N. Levchenko, A. M. Danil'chenko

Publication date: 1985

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

NP-completenessapproximate polynomial algorithmthree-machine problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items

On some geometric methods in scheduling theory: A survey