A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time

From MaRDI portal

(Redirected from A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time)

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_combinatorial_2-approximation_algorithm_for_precedence-constrained_scheduling_a_single_machine_to_minimize_average_weighted_completion_time&oldid=70361913"