scientific article

From MaRDI portal

Publication:3980709

Jump to:navigation, search

zbMath0812.90071MaRDI QIDQ3980709

Vitaly A. Strusevich

Publication date: 26 June 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-hard precedence constraints polynomial-time algorithms complexity of optimal scheduling two-stage nonhomogeneous systems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3980709&oldid=12024810"