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 Publication:337223)

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