Parallel hybrid heuristics for the permutation flow shop problem
From MaRDI portal
Recommendations
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A comprehensive review and evaluation of permutation flowshop heuristics
- Parallel Processing and Applied Mathematics
- A computational study of the permutation flow shop problem based on a tight lower bound
- Fast heuristics for minimizing the makespan in non-permutation flow shops
Cites work
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- A comprehensive review and evaluation of permutation flowshop heuristics
- A genetic algorithm for flowshop sequencing
- A high quality solution constructive heuristic for flow shop sequencing
- A new memetic algorithm for the asymmetric traveling salesman problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A tabu search approach for the flow shop scheduling problem
- An Evaluation of Flow Shop Sequencing Heuristics
- Benchmarks for basic scheduling problems
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- Handbook of metaheuristics
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Optimal two- and three-stage production schedules with set-up time included
- Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
- Some efficient heuristic methods for the flow shop sequencing problem
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
Cited in
(8)- Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Parallel Processing and Applied Mathematics
- Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
- 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
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
This page was built for publication: Parallel hybrid heuristics for the permutation flow shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761767)
