scientific article; zbMATH DE number 3972609

MaRDI QIDQ3738903zbMATH OpenFDO

Authors S. A. Borodich, V. A. Strusevich

Publication date 1986

zbMATH Keywords

chain-like precedence constraintstwo-machine open shop preemptive scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4020835
• On the complexity of preemptive open-shop scheduling problems
• Shop scheduling problems under precedence constraints
• Open shop scheduling with some additional constraints
• scientific article; zbMATH DE number 3883928

Cited in

(5)

• Complexity of mixed shop scheduling problems: A survey
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• scientific article; zbMATH DE number 4131936 (Why is no real title available?)
• scientific article; zbMATH DE number 4020835 (Why is no real title available?)
• Complexity of optimal 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 Q3738903)