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

From MaRDI portal

(Redirected from Publication:1422367)

Jump to:navigation, search

MaRDI QID[[Item:|]]

Authors

No records found

Cited in

No records found

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )

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"