Complexity and approximation for precedence constrained scheduling problems with large communication delays

From MaRDI portal

Jump to:navigation, search

WRNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Complexity_and_approximation_for_precedence_constrained_scheduling_problems_with_large_communication_delays&oldid=65465640"