Abstract
This study extends the previous exact algorithm based on Lagrangian relaxation and dynamic programming for single-machine scheduling without machine idle time so that it can treat the problem with machine idle time permitted. Then, its effectiveness is examined by several numerical experiments.