Pages that link to "Item:Q992723"
From MaRDI portal
The following pages link to Shifting representation search for hybrid flexible flowline problems (Q992723):
Displaying 11 items.
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
- An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility (Q1782178) (← links)
- Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← links)
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
- Iterated greedy for the maximum diversity problem (Q2275623) (← links)
- Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem (Q2669577) (← links)
