Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
From MaRDI portal
Publication:342177
DOI10.1016/j.cor.2015.08.001zbMath1349.90318OpenAlexW2199221478MaRDI QIDQ342177
Marcus Ritt, Alexander J. Benavides
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.08.001
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
Cites Work
- Unnamed Item
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing 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
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- An empirical analysis of the optimality rate of flow shop heuristics
- The one-machine sequencing problem
- Permutation vs. non-permutation flow shop schedules
- A fast tabu search algorithm for the permutation flow-shop problem
- A new constructive heuristic for the flowshop scheduling problem
- Benchmarks for shop scheduling problems
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- A genetic algorithm for flowshop sequencing
- Flow-shop problems with intermediate buffers
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A comprehensive review and evaluation of permutation flowshop heuristics
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Optimal two- and three-stage production schedules with setup times included
- Flowshop sequencing problems with limited buffer storage
- Flowshop and Jobshop Schedules: Complexity and Approximation
- An Evaluation of Flow Shop Sequencing Heuristics
- A New Heuristic for Three-Machine Flow Shop Scheduling
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- Tight Bounds for Permutation Flow Shop Scheduling
This page was built for publication: Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
