A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

From MaRDI portal

(Redirected from A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays)

Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_fully_polynomial_approximation_scheme_for_a_scheduling_problem_with_intree-type_precedence_delays&oldid=81223526"