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.001zbMATH Open1349.90318OpenAlexW2199221478MaRDI QIDQ342177FDOQ342177
Authors: Alexander J. Benavides, Marcus Ritt 
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
Recommendations
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A new constructive heuristic for the flowshop scheduling problem
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Permutation vs. non-permutation flow shop schedules
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- A genetic algorithm for flowshop sequencing
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- The one-machine sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- Benchmarks for shop scheduling problems
- 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
- 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 Evaluation of Flow Shop Sequencing Heuristics
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- An empirical analysis of the optimality rate of flow shop heuristics
- On recent modifications and extensions of the NEH heuristic for flow shop sequencing
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Flowshop sequencing problems with limited buffer storage
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- Tight bounds for permutation flow shop scheduling
- Permutation vs. non-permutation flow shop schedules
- A new constructive heuristic for the flowshop scheduling problem
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Flow-shop problems with intermediate buffers
- A New Heuristic for Three-Machine Flow Shop Scheduling
Cited In (8)
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- 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 Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
This page was built for publication: Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342177)
