3 papers
math.OC2026
The Car Resequencing Problem with Makespan Minimization
Xinyi Guo, Jean-François Côté
Problem definition: The car resequencing problem involves rearranging the sequence of cars between two adjacent production shops via an intermediate buffer. This study explores a n…
math.OC2026
The Stochastic Team Orienteering Problem
Alberto Guastalla, Jean-François Côté, Roberto Aringhieri
This paper analyses the Stochastic Team Orienteering Problem (STOP), a stochastic variant of the Team Orienteering Problem (TOP). In the STOP, travel times are represented by rando…
math.OC2026
An Exact Combinatorial Branch-and-Bound Algorithm for the Job Sequencing and Tool Switching Problem
Alberto Locatelli, Jean-François Côté, Leandro C. Coelho
The Job Sequencing and Tool Switching Problem (SSP) is a well-known combinatorial optimization problem arising in the context of flexible manufacturing. Since the seminal work of T…