A polynomially solvable case of the three machine Johnson problem

MaRDI QIDQ3115622zbMATH OpenFDO

Authors V. V. Servakh

Publication date 10 February 2012

zbMATH Keywords

scheduling problemthree-stage shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4128650
• scientific article; zbMATH DE number 3978798
• An approximate algorithm for the three-machine problem
• scientific article; zbMATH DE number 3980892
• The problem of three machines with indeterminate times of processing

Cited in

(5)

• An approximate algorithm for the three-machine problem
• The problem of three machines with indeterminate times of processing
• scientific article; zbMATH DE number 3978798 (Why is no real title available?)
• scientific article; zbMATH DE number 3980892 (Why is no real title available?)
• scientific article; zbMATH DE number 4128650 (Why is no real title available?)

This page was built for publication: A polynomially solvable case of the three machine Johnson problem

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