scientific article; zbMATH DE number 3989091

MaRDI QIDQ3751360zbMATHFDO

Authors V. A. Strusevich

Publication date 1986

zbMATH Keywords

NP-hardopen shop schedulingefficiently solvable special cases

Mathematics Subject Classification ID

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

Cited in

(3)

• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• NP-hardness of shop-scheduling problems with three jobs

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