Mip-based local search for permutation flowshop scheduling with makespan objective

DOI10.1016/J.COR.2025.107309MaRDI QIDQ6855216zbMATH OpenFDO

Authors Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford

Publication date 23 February 2026

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

Full work available at URL https://doi.org/10.1016/J.COR.2025.107309

zbMATH Keywords

flowshop schedulingmatheuristicspermutation flowshopvery large-scale neighbourhood search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
• A branch-and-bound-based local search method for the flow shop problem
• A comprehensive review and evaluation of permutation flowshop heuristics
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
• A matheuristic approach for the two-machine total completion time flow shop problem
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• A note on permutation flow shop problem
• A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• A systematic review of permutation flow shop scheduling with due-date-related objectives
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• An improved NEH-based heuristic for the permutation flowshop problem
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
• Benchmarks for basic scheduling problems
• Comparative evaluation of MILP flowshop models
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• Matheuristics. Algorithms and implementations
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• New hard benchmark for flowshop scheduling problems minimising makespan
• On some lower bounds for the permutation flowshop problem
• 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
• Tight bounds for permutation flow shop scheduling

Cited in

(1)

• Sparse convex quantile regression: a generalized Benders decomposition approach

This page was built for publication: Mip-based local search for permutation flowshop scheduling with makespan objective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855216)