An exact algorithm for the precedence-constrained single-machine scheduling problem
The precedence-constrained single-machine scheduling problem is considered. An efficient exact algorithm is proposed based on our previous studies. The SSDP (Successive Sublimation Dynamic Programming) method is employed. Instances of the total weighted tardiness problem with up to 100 jobs are solved.
exact algorithm single-machine scheduling dynamic programming precedence constraints lagrangian relaxation