Dynamic programming approach to the single-machine sequencing problem with different due-dates
A collection of jobs is to be processed in such a way that the sum of absolute deviations of job completion times about their respective due- dates is minimized. The problem is NP-complete and a dynamic programming approach is described which offers considerable computational savings over complete enumeration.
scientific article; zbMATH DE number 4147880
scientific article