scientific article; zbMATH DE number 4154198

MaRDI QIDQ3483071zbMATH OpenFDO

Authors Yuri N. Sotskov, N. V. Shakhlevich

Publication date 1990

zbMATH Keywords

maximal or mean flow timeNP-hard

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4099022
• NP-hardness of shop-scheduling problems with three jobs
• The Three-Machine No-Wait Flow Shop is NP-Complete
• The complexity of shop-scheduling problems with two or three jobs
• Minimizing Total Tardiness on One Machine is NP-Hard

Cited in

(7)

• Scheduling two jobs with fixed and nonfixed routes
• On the NP-hardness of scheduling with time restrictions
• On the drift of short schedules.
• NP-hardness of shop-scheduling problems with three jobs
• NP-hardness proof for the assembly problem with stationary setup and additive holding costs
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• scientific article; zbMATH DE number 4099022 (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 Q3483071)