Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem

DOI10.1007/s11590-016-1086-5zbMath1380.90124OpenAlexW2531932856MaRDI QIDQ1676480

Federico Pagnozzi, Thomas Stützle

Publication date: 9 November 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-016-1086-5

zbMATH Keywords

schedulingflowshopweighted tardinessspeed-upinsert neighborhood

Mathematics Subject Classification ID

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

Related Items (2)

Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling

Cites Work

• 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
• A fast tabu search algorithm for the permutation flow-shop problem
• A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem

This page was built for publication: Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem