A Survey of Single Machine Scheduling to Minimize Weighted Number of Tardy Jobs

@inproceedings{Adamu2013ASO,
  title={A Survey of Single Machine Scheduling to Minimize Weighted Number of Tardy Jobs},
  author={Muminu O. Adamu and Aderemi Oluyinka Adewumi},
  year={2013}
}
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 pj and due date dj . The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job j is Cj > dj and on-time otherwise. This… CONTINUE READING