An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem

DOI10.1016/j.cor.2016.12.021zbMath1391.90257OpenAlexW2564072466WikidataQ56524108 ScholiaQ56524108MaRDI QIDQ1652233

Federico Pagnozzi, Jérémie Dubois-Lacoste, Thomas Stützle

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.021

zbMATH Keywords

schedulingcombinatorial optimizationmakespanheuristic algorithmsiterated greedypermutation flowshop problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (21)

Constraint guided accelerated search for mixed blocking permutation flowshop scheduling ⋮ Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems ⋮ Stochastic local search and parameters recommendation: a case study on flowshop problems ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ Flowshop with additional resources during setups: mathematical models and a GRASP algorithm ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ 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 variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective

Cites Work

• New hard benchmark for flowshop scheduling problems minimising makespan
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing 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
• Heuristics for large constrained vehicle routing problems
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• Minimizing Total Tardiness on One Machine is NP-Hard
• Matheuristics
• The Complexity of Flowshop and Jobshop Scheduling
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Equation of State Calculations by Fast Computing Machines
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows

This page was built for publication: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem