One Benders cut to rule all schedules in the neighbourhood

Open Webpage

Ioannis Avgerinos, Ioannis Mourtos, Stavros Vatikiotis, Georgios Zois

Published: 2025, Last Modified: 11 Dec 2025Eur. J. Oper. Res. 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Parallel machine scheduling to minimise total completion time or tardiness.•Combining local branching with Branch-and-Check to rule out neighbourhoods of solutions.•Position-based MILP formulations as a master problem.•Common local search operators to construct valid 4-OPT neighbourhoods.•Computational evidence showing the impact of implementing local branching.