Shifting representation search for hybrid flexible flowline problems
From MaRDI portal
(Redirected from Publication:992723)
Recommendations
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- Local Search in Complex Scheduling Problems
- Algorithms for a realistic variant of flowshop scheduling
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- Hybrid flexible flowshop problems: models and solution methods
Cites work
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- A comprehensive review and evaluation of permutation flowshop heuristics
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem
- A hybrid genetic algorithm for the job shop scheduling problem
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A survey of scheduling problems with setup times or costs
- A taxonomy of flexible flow line scheduling procedures
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems
- scientific article; zbMATH DE number 1703885 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- Local Search in Complex Scheduling Problems
- Modeling realistic hybrid flexible flowshop scheduling problems
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Scheduling
- Scheduling flexible flow lines with sequence-dependent setup times
- The hybrid flow shop scheduling problem
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
Cited in
(13)- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Iterated greedy for the maximum diversity problem
- Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
- 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
- A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths
- Job-shop scheduling problem with limited input buffers: mathematical models and solution methods
This page was built for publication: Shifting representation search for hybrid flexible flowline problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992723)
