Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
From MaRDI portal
(Redirected from Publication:342177)
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
Cites work
- A New Heuristic for Three-Machine Flow Shop Scheduling
- A comprehensive review and evaluation of permutation flowshop heuristics
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flowshop sequencing
- A new constructive heuristic for the 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
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- An Evaluation of Flow Shop Sequencing Heuristics
- An empirical analysis of the optimality rate of flow shop heuristics
- An improved NEH heuristic to minimize makespan in permutation flow shops
- An improved NEH-based heuristic for the permutation flowshop problem
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- Benchmarks for shop scheduling problems
- Flow-shop problems with intermediate buffers
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Flowshop sequencing problems with limited buffer storage
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- On recent modifications and extensions of the NEH heuristic for flow shop sequencing
- Optimal two- and three-stage production schedules with set-up time included
- Permutation vs. non-permutation flow shop schedules
- Some efficient heuristic methods for the flow shop sequencing problem
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- The one-machine sequencing problem
- Tight bounds for permutation flow shop scheduling
Cited in
(9)- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
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)
