- Model with sets
- Zero-block constraints
- Statement (Senne, Yanasse): given the job sequence, the lower bound for switches can be found with KTNS (Keep Tool Needed Soonest) algorithm (Tang, Denardo)
- Add times to stats for finding optimal value and optimality proof
- Dynamic MST for better upper bound
- Channelling (sets + MIP)
- Use lower bound algorithm (Yanasse/Senne) to a) improve lower bound, b) use initial sequence
- Switch to CubDB or similar for result tracking/storing
- Algo for proving upper bound for instances with small optimality gap?