Pages that link to "Item:Q1791918"
From MaRDI portal
The following pages link to A multi-objective variable neighborhood search algorithm for solving the hybrid flow shop problem (Q1791918):
Displaying 10 items.
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
- Branch and bound crossed with GA to solve hybrid flowshops (Q1296101) (← links)
- A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time (Q1792653) (← links)
- Portfolio decision analysis with a generalized balance approach (Q2146968) (← links)
- A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint (Q2150477) (← links)
- An adaptive variable neighborhood search for solving the multi-objective node placement problem (Q2631257) (← links)
- Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
- Multi-objective home health care routing: a variable neighborhood search method (Q6063518) (← links)
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem (Q6066726) (← links)
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
