SCHEDULING WITH 2 JOB CLASSES AND SETUP TIMES TO MINIMIZE THE NUMBER OF TARDY JOBS

This paper considers the problem of minimizing the number of tardy job s to be processed on a single machine with two job classes where a job 's setup time depends on its job class. This is an increasingly import ant problem due to the growing popularity of group technology manufact uring techniques, where jobs are divided into job classes (families). Using the optimal properties of Moore's algorithm, two approximate alg orithms are developed and illustrated with an example. A simulation st udy conducted to examine the effectiveness of the proposed algorithms shows that the proposed algorithms perform significantly better than M oore's algorithm and its extension.