Computers & Operations Research · 2022 · 22 citations · 38 references
Natural SciencesIndustrial EngineeringOperations ManagementAlgorithmsOptimizationSchedulingAssignment ProblemsCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingMetaheuristic OptimizationTardiness MinimizationLocal SearchLocal Search AlgorithmsMaximum Tardiness MinimizationNeighborhood SearchTotal Weighted Tardiness
We consider the No-idle Permutation Flowshop Scheduling Problem (NPFSP) with a total tardiness criterion. We present two Mixed Integer Linear Programming (MILP) formulations based on positional and precedence variables, respectively. We study six local search procedures that explore two different neighborhoods by exploiting the MILP formulations. Our computational experiments show that two of the proposed procedures strongly outperform the state-of-the-art metaheuristic. We update 63% of the best known solutions of the instances in Taillards’ benchmark, and 77% if we exclude those instances for which we proved that the previous best known solutions are optimal.
38
Benchmarks for basic scheduling problems
Éric D. Taillard · European Journal of Operational Research · 1993 · 2.4K citations