Multi-Machine Scheduling Lower Bounds Using Decision Diagrams

We investigate the use of relaxed decision diagrams for obtaining lower bounds on multi-machine scheduling problems. The type of scheduling problem we consider models a railway service site where maintenance jobs are performed, but is sufficiently general to potentially have wider applicability.<br/>We find that our decision diagram formulation...