Numerical study. We performed numerical tests in order to evaluate the performance of the DP algorithm. We considered different combinations of the number of jobs, the maximum processing time, and the range of due-dates. The numbers of jobs were: . The job processing times were generated uniformly in the interval , where the values of considered were 50 and 100. The due-date were generated uniformly in the interval , where is the tightness factor. Two values of were considered: 0.7 and 1. For each combination of, and (a total of problem sets), 25 instances were generated and solved (a total of instances). For each problem set we measured the average and worst case running times. Table 2 summarizes the results. [The Python program was executed on a MacBook Pro with a 2.3 GHz i7 processor, and 8 GB MHz DDR3 RAM.]