An improved approximation scheme for the Johnson problem with parallel machines

MaRDI QIDQ3115636zbMATH OpenFDO

Authors Sergey Sevastyanov

Publication date 10 February 2012

zbMATH Keywords

flexible flow shopshort shop schedule

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for the parallel flow shop problem
• Improved approximation schemes for scheduling unrelated parallel machines
• Approximation schemes for scheduling on parallel machines
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• A polynomial-time approximation scheme for maximizing the minimum machine completion time

Cited in

(1)

• scientific article; zbMATH DE number 919276 (Why is no real title available?)

This page was built for publication: An improved approximation scheme for the Johnson problem with parallel machines

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