An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.

From MaRDI portal

(Redirected from An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.)

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=An_efficient_tabu_search_approach_for_the_two-machine_preemptive_open_shop_scheduling_problem.&oldid=71871210"