An approximate algorithm for the three-machine problem

MaRDI QIDQ1079490zbMATH OpenFDO

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

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)

Recommendations

• Publication:4207780
• A polynomially solvable case of the three machine Johnson problem
• scientific article; zbMATH DE number 3978798
• The Three-Machine No-Wait Flow Shop is NP-Complete
• scientific article; zbMATH DE number 3980892

Cited in

(10)

• scientific article; zbMATH DE number 4128650 (Why is no real title available?)
• A polynomially solvable case of the three machine Johnson problem
• An efficient algorithm for the three-guard problem
• scientific article; zbMATH DE number 4108469 (Why is no real title available?)
• scientific article; zbMATH DE number 1472149 (Why is no real title available?)
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• scientific article; zbMATH DE number 919276 (Why is no real title available?)
• On some geometric methods in scheduling theory: A survey
• scientific article; zbMATH DE number 3980892 (Why is no real title available?)
• scientific article; zbMATH DE number 4068591 (Why is no real title available?)

This page was built for publication: An approximate algorithm for the three-machine problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079490)