The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
From MaRDI portal
Publication:2242240
DOI10.1016/J.EJOR.2021.05.014zbMath1487.90269OpenAlexW3164375063MaRDI QIDQ2242240
Alexander J. Benavides, Antony Vera
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.05.014
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- 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
- An empirical analysis of the optimality rate of flow shop heuristics
- 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
- A comprehensive review and evaluation of permutation flowshop heuristics
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- Flow shops with reentry: reversibility properties and makespan optimal schedules
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- Benchmarks for basic scheduling problems
- An improved NEH heuristic to minimize makespan in permutation flow shops
- The Reversibility Property of Production Lines
- A Friedman-Type Rank Test for Main Effects in a Two-Factor ANOVA
- A high quality solution constructive heuristic for flow shop sequencing
This page was built for publication: The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
