科研之友
微信
新浪微博
Facebook
分享链接
摘要
We consider a single machine scheduling problem in which the processing time of a job is a nondecreasing function of its starting time. The jobs have a common due date. The objective is to minimize the weighted number of tardy jobs. The problem is NP-hard. We present a pseudo-polynomial dynamic programming algorithm and a fully polynomial-time approximation scheme (FPTAS).
- 出版日期2017-4
- 单位沈阳师范大学
