Parallel hybrid heuristics for the permutation flow shop problem
From MaRDI portal
Publication:1761767
DOI10.1007/s10479-011-1056-3zbMath1251.90180OpenAlexW1978576893WikidataQ58072383 ScholiaQ58072383MaRDI QIDQ1761767
Carlos M. C. Riveros, Alexandre Mendes, Martín Gómez Ravetti
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-1056-3
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
Uses Software
Cites Work
- Unnamed Item
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- A tabu search approach for the flow shop scheduling problem
- A genetic algorithm for flowshop sequencing
- A new memetic algorithm for the asymmetric traveling salesman problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Optimal two- and three-stage production schedules with setup times included
- An Evaluation of Flow Shop Sequencing Heuristics
- A high quality solution constructive heuristic for flow shop sequencing
- Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
- Handbook of metaheuristics
This page was built for publication: Parallel hybrid heuristics for the permutation flow shop problem