A SURVEY OF SINGLE MACHINE SCHEDULING TO MINIMIZE WEIGHTED NUMBER OF TARDY JOBS

This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time p(j) and due date d(j). The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job j is C-j > d(j) and on-time otherwise. This paper assesses works done to minimize the weighted number of tardy jobs by providing an extensive review of authors, methods and techniques used. Finally, the possible direction for future research is presented.