scientific article; zbMATH DE number 4099022

MaRDI QIDQ3824093zbMATH OpenFDO

Authors Yuri N. Sotskov

Publication date 1989

zbMATH Keywords

fixed machine ordersNP-hardoptimal makespan scheduling

Mathematics Subject Classification ID

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

Recommendations

• NP-hardness of shop-scheduling problems with three jobs
• Publication:3483071
• Scheduling two jobs with fixed and nonfixed routes
• The complexity of shop-scheduling problems with two or three jobs
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs

Cited in

(7)

• The complexity of shop-scheduling problems with two or three jobs
• An ordered independence system and its applications to scheduling problems
• NP-hardness of shop-scheduling problems with three jobs
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Scheduling problem: complexity analysis and polynomially solvable subclasses
• scientific article; zbMATH DE number 4154198 (Why is no real title available?)
• scientific article; zbMATH DE number 781213 (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 Q3824093)