On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
From MaRDI portal
(Redirected from Publication:336966)
Recommendations
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- An improved NEH heuristic to minimize makespan in permutation flow shops
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A high quality solution constructive heuristic for flow shop sequencing
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- 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
- Benchmarks for basic scheduling problems
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Flowshop-scheduling problems with makespan criterion: a review
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- 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
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some efficient heuristic methods for the flow shop sequencing problem
Cited in
(32)- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization
- \(N\)-NEH+ algorithm for solving permutation flow shop problems
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
- A generalized constructive algorithm using insertion-based heuristics
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- The seeds of the NEH algorithm: an overview using bibliometric analysis
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Evaluating the impact of grammar complexity in automatic algorithm design
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
This page was built for publication: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336966)
