Research Article

Minimizing the Number of Tardy Jobs on a Single Machine with an Availability Constraint

Table 7

Results of instances solved by Chen [15], .

SeriesNumber of jobs Number of optimal instancesComp. time of BB (s)
BBHMinAve.Max

102020>0>0>0
201514>017.34260.13
301515>0>0>0
4099>0>0>0
501313>0>00.03

102015>00.020.38
201913>0166.101950.53
301717>0>0>0
401717>0>0>0
502020>0>0>0
702020>0>0>0
1002020>0>0>0
3002020>0>00.02
5002020>0>00.02
7002020>0>00.02
10002020>00.010.02
300020200.060.070.11
500020200.170.180.19
700020200.360.360.38
1000020200.730.750.83

102020>0>0>0
202020>0>00.02
302020>0>00.02
402020>0>00.02
502020>0>00.02
702020>00.010.02
10020200.020.020.03
30020200.380.400.45
50020201.801.932.33
70020204.785.055.61
1000202014.0314.5715.47
30002020388.59399.03409.45
500020201858.271892.571915.16
70000

102020>0>00.05
202020>0>00.02
302020>0>0>0
402020>0>0>0
502020>0>00.02
702020>0>00.02
1002020>00.010.02
30020200.280.310.34
50020201.311.411.52
70020203.693.854.45
1000202010.8011.2511.88
30002020303.16309.80319.99
500020201435.111481.241618.86
70000