scientific article; zbMATH DE number 4154198

zbMATH Open0703.90049MaRDI QIDQ3483071FDOQ3483071

Authors: Yuri N. Sotskov, N. V. Shakhlevich 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

NP-hardmaximal or mean flow time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (7)

• On the drift of short schedules.
• On the NP-hardness of scheduling with time restrictions
• NP-hardness proof for the assembly problem with stationary setup and additive holding costs
• Title not available (Why is that?)
• Scheduling two jobs with fixed and nonfixed routes
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• 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 Q3483071)