Fast heuristics for minimizing the makespan in non-permutation flow shops
From MaRDI portal
Publication:1782179
DOI10.1016/j.cor.2018.07.017zbMath1458.90254OpenAlexW2884652221WikidataQ129506736 ScholiaQ129506736MaRDI QIDQ1782179
Marcus Ritt, Alexander J. Benavides
Publication date: 18 September 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.017
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
Cites Work
- Unnamed Item
- Unnamed Item
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- Scheduling flow shops using differential evolution algorithm
- 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
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- An empirical analysis of the optimality rate of flow shop heuristics
- Permutation vs. non-permutation flow shop schedules
- A new constructive heuristic for the flowshop scheduling problem
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- Throughput optimization in robotic cells
- Some aspects of scatter search in the flow-shop problem
- A Friedman-Type Rank Test for Main Effects in a Two-Factor ANOVA
- A Fast Taboo Search Algorithm for the Job Shop Problem
This page was built for publication: Fast heuristics for minimizing the makespan in non-permutation flow shops
