科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2014-1
