Jul 2026
Sequence and Speed Optimization
Two polynomial-time algorithms for the SOP, one to solve the SOP and another to compute all possible completion times for a sequence, along with proofs of optimality, and a branch-and-price algorithm, incorporating a new dominance rule, for the joint routing and speed optimization problem.
Stefan Schaudt, T. Bektaş
· INFORMS journal on computing · 0 citations