An approximate algorithm for the three-machine problem

zbMATH Open0597.90046MaRDI QIDQ1079490FDOQ1079490

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)

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

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)

Cited In (10)

• Title not available (Why is that?)
• A polynomially solvable case of the three machine Johnson problem
• An efficient algorithm for the three-guard problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Title not available (Why is that?)
• On some geometric methods in scheduling theory: A survey
• Title not available (Why is that?)
• Title not available (Why is that?)

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)