scientific article; zbMATH DE number 22879

MaRDI QIDQ3980709zbMATH OpenFDO

Authors V. A. Strusevich

Publication date 26 June 1992

zbMATH Keywords

complexity of optimal schedulingNP-hardpolynomial-time algorithmsprecedence constraintstwo-stage nonhomogeneous systems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 555729
• scientific article; zbMATH DE number 781213
• scientific article; zbMATH DE number 4020835
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard

Cited in

(7)

• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Reachability and deadlocking problems in multi-stage scheduling
• scientific article; zbMATH DE number 3941255 (Why is no real title available?)
• Inhomogeneous deterministic two-stage queueing systems
• scientific article; zbMATH DE number 555729 (Why is no real title available?)
• On The Complexity Of The Process Shop
• 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 Q3980709)