A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

From MaRDI portal

(Redirected from A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan)

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_best_online_algorithm_for_unbounded_parallel-batch_scheduling_with_restarts_to_minimize_makespan&oldid=63377184"