Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling

DOI10.1016/j.ejor.2019.10.017zbMath1431.90064OpenAlexW2980601495WikidataQ126998752 ScholiaQ126998752MaRDI QIDQ2286871

Jose M. Molina-Pariente, Jose M. Framinan, Victor Fernandez-Viagas

Publication date: 23 January 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.10.017

zbMATH Keywords

schedulingflow shopcritical pathspeed-up

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

Iterative beam search algorithms for the permutation flowshop ⋮ 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 ⋮ 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 ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem

Cites Work

• Unnamed Item
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
• 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
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
• Some efficient heuristic methods for the flow shop sequencing problem
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• Iterated greedy local search methods for unrelated parallel machine scheduling
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
• The distributed permutation flowshop scheduling problem
• The job shop scheduling problem: Conventional and new solution techniques
• A fast tabu search algorithm for the permutation flow-shop problem
• Heuristics for the flow line problem with setup costs
• The flow shop with parallel machines: A tabu search approach
• The permutation flow shop with buffers: A tabu search approach
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• A comprehensive review and evaluation of permutation flowshop heuristics
• Fast heuristics for minimizing the makespan in non-permutation flow shops
• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
• A decomposition algorithm for the single machine total tardiness problem
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• Benchmarks for basic scheduling problems
• Some aspects of scatter search in the flow-shop problem
• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• Flowshop-scheduling problems with makespan criterion: a review

This page was built for publication: Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling