A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion

From MaRDI portal

(Redirected from A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion)

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_hybrid_variable_neighborhood_search_algorithm_for_solving_the_limited-buffer_permutation_flow_shop_scheduling_problem_with_the_makespan_criterion&oldid=61150230"