Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine

The authors examine a class of single-machine scheduling problems with sequence-dependent setup times that arise in the context of semiconductor tes operations. They present heuristics for the problems of minimizing maximum lateness with dynamic arrivals and minimizing number of tardy jobs. The authors exploit special problem structure to derive worst-case error bounds. The special problem structure also enables them to derive dynamic programming procedures for the problem where all jobs are available simultaneously.