New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

From MaRDI portal

(Redirected from Publication:1761791)

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=New_algorithms_and_complexity_status_of_the_reducibility_problem_of_sequences_in_open_shop_scheduling_minimizing_the_makespan&oldid=73379883"