This paper proposes an exact exponential algorithm for the single machine total tardiness
problem. It exploits the structure of a basic branch-and-reduce framework based on the well …

This PhD thesis summarizes research works on the design of exact algorithms that provide a
worst-case (time or space) guarantee for NP-hard scheduling problems. Both theoretical and …