3 papers
math.OC2026
Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines
Quentin Schau, Federico Della Croce, Olivier Ploton +1
This work addresses the uniform parallel machine scheduling problem within an optimistic bilevel optimization framework. The leader seeks to minimize the weighted number of tardy j…
math.OC2026
Revisiting Johnson's rule for minimizing makespan in the Two-Machine Flow Shop scheduling problem
Federico Della Croce, Quentin Schau
We consider Johnson's rule for minimizing the makespan in the two-machine flow shop problem. Although its worst-case time complexity is O(n log n), we show that it is possible to d…
cs.DC2018
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
F Croce, Thierry Garaix, A. Grosso
We present computational results with a heuristic algorithm for the parallel machines total weighted tardiness problem. The algorithm combines generalized pairwise interchange neig…