scientific article; zbMATH DE number 3896632

MaRDI QIDQ3675864zbMATH OpenFDO

Authors Sergey Sevastyanov

Publication date 1982

zbMATH Keywords

Johnson scheduling problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4128650
• scientific article; zbMATH DE number 3871006
• An algorithm for the solution of the two-route Johnson problem
• scientific article; zbMATH DE number 1091396
• scientific article; zbMATH DE number 4137518

Cited in

(9)

• The flow shop problem with no-idle constraints: a review and approximation
• On some geometric methods in scheduling theory: A survey
• Vector summation within minimal angle
• The simple F2//C with forbidden tasks in first or last position: a problem more complex that it seems
• Performance guarantees for flowshop heuristics to minimize makespan
• Ordering of jobs with three different processing times in the \(Mxn\) Bellman-Johnson problem
• scientific article; zbMATH DE number 3871006 (Why is no real title available?)
• scientific article; zbMATH DE number 4128650 (Why is no real title available?)
• scientific article; zbMATH DE number 1091396 (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 Q3675864)