Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
From MaRDI portal
(Redirected from Publication:2286871)
Recommendations
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- A fast method for heuristics in large-scale flow shop scheduling
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A decomposition algorithm for the single machine total tardiness problem
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- A fast tabu search algorithm for the permutation flow-shop problem
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Benchmarks for basic scheduling problems
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- Flowshop-scheduling problems with makespan criterion: a review
- Heuristics for the flow line problem with setup costs
- Introduction to algorithms.
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some aspects of scatter search in the flow-shop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem
- The distributed permutation flowshop scheduling problem
- The flow shop with parallel machines: A tabu search approach
- The job shop scheduling problem: Conventional and new solution techniques
- The permutation flow shop with buffers: A tabu search approach
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
Cited in
(22)- Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- Iterative beam search algorithms for the permutation flowshop
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- Shop scheduling in manufacturing environments: a review
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems
- A review and classification on distributed permutation flowshop scheduling problems
- Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem
- Flowshop with additional resources during setups: mathematical models and a GRASP algorithm
- The seeds of the NEH algorithm: an overview using bibliometric analysis
- A bi-cooperative parallel evolutionary algorithm for co-scheduling of distributed production and distribution considering shared transportation resources
- Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups?
- Integrated optimization of design and production process with personalization level of products
- A systematic review of permutation flow shop scheduling with due-date-related objectives
- Transportation and delivery in flow-shop scheduling problems: a systematic review
- A speed-up procedure and new heuristics for the classical job shop scheduling problem: a computational evaluation
- Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach
This page was built for publication: Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286871)
