Shifting representation search for hybrid flexible flowline problems
From MaRDI portal
Publication:992723
DOI10.1016/j.ejor.2010.05.041zbMath1206.90049OpenAlexW2142809705MaRDI QIDQ992723
Rubén Ruiz, Thijs Urlings, Thomas Stützle
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.041
Related Items
New hard benchmark for flowshop scheduling problems minimising makespan ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ Iterated greedy for the maximum diversity problem ⋮ A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
Cites Work
- Unnamed Item
- Unnamed Item
- Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems
- A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A taxonomy of flexible flow line scheduling procedures
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
- Modeling realistic hybrid flexible flowshop scheduling problems
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- Scheduling flexible flow lines with sequence-dependent setup times
- The hybrid flow shop scheduling problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A survey of scheduling problems with setup times or costs
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A hybrid genetic algorithm for the job shop scheduling problem
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- Local Search in Complex Scheduling Problems
- Scheduling
