scientific article; zbMATH DE number 3978798

zbMATH Open0605.90065MaRDI QIDQ3743085FDOQ3743085

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

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

sequencingpolynomiality conditionsthree-machine flow-shop

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• A polynomially solvable case of the three machine Johnson problem
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Title not available (Why is that?)
• An approximate algorithm for the three-machine problem

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)