scientific article; zbMATH DE number 3978798

MaRDI QIDQ3743085zbMATH OpenFDO

Authors S. A. Beletskij, A. M. Danil'chenko, A. V. Panishev

Publication date 1985

zbMATH Keywords

polynomiality conditionssequencingthree-machine flow-shop

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(6)

• An approximate algorithm for the three-machine problem
• The problem of three machines with indeterminate times of processing
• A polynomially solvable case of the three machine Johnson problem
• The Three-Machine No-Wait Flow Shop is NP-Complete
• scientific article; zbMATH DE number 4108469 (Why is no real title available?)
• scientific article; zbMATH DE number 4128650 (Why is no real title available?)

This page was built for publication:

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