scientific article; zbMATH DE number 919276

MaRDI QIDQ4888940zbMATH OpenFDO

Authors A. G. Shchukin, N. I. Glebov

Publication date 25 August 1996

zbMATH Keywords

NP-completenesstwo-machine Johnson problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 4128650
• An algorithm for the solution of the two-route Johnson problem
• An approximate algorithm for the three-machine problem
• On the complexity of two machine job-shop scheduling with regular objective functions
• An improved approximation scheme for the Johnson problem with parallel machines

Cited in

(1)

• A 2-machine sequencing problem with machine repetition and overlapping processing times

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 Q4888940)