Improved integer linear programming formulations for the job Sequencing and tool Switching Problem
We study the job Sequencing and tool Switching Problem, arising in computer systems. We study the polyhedral combinatorics of the problem. We develop new integer linear programming formulations for the problem. We show that the formulations are provably better than the current state-of-the-art.
job sequencing tool switching traveling salesman problem combinatorial optimization integer programming