A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
From MaRDI portal
Publication:2329724
DOI10.1016/j.cor.2019.104767zbMath1458.90290OpenAlexW2967278017WikidataQ127366159 ScholiaQ127366159MaRDI QIDQ2329724
Jose M. Framinan, Victor Fernandez-Viagas
Publication date: 18 October 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.104767
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Iterative beam search algorithms for the permutation flowshop ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach ⋮ Flowshop with additional resources during setups: mathematical models and a GRASP algorithm ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
Cites Work
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved NEH-based heuristic for the permutation flowshop problem
- A fast tabu search algorithm for the permutation flow-shop problem
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- Benchmarks for basic scheduling problems
- An improved NEH heuristic to minimize makespan in permutation flow shops
This page was built for publication: A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
