Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time

From MaRDI portal

(Redirected from Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total 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=Complexity_and_approximation_of_single_machine_scheduling_with_an_operator_non-availability_period_to_minimize_total_completion_time&oldid=62285031"