科研之友
微信
新浪微博
Facebook
分享链接
摘要
Baker and Smith [J. Scheduling, 6, 7-16, 2003] introduced a new model of scheduling in which there are two or more distinct families of jobs pursuing different objectives. Their contributions include two polynomial-time dynamic programming recursions, respectively, for the single machine scheduling with two families of jobs to minimize a positive combination of total weighted completion time, or maximum lateness, of the first family of jobs and maximum lateness of the second family of jobs. Unfortunately, these dynamic programming recursions are incorrect. In this paper, we solve the same problems by an O(n(1) n(2)(n(1) + n(2))) time algorithm.
- 出版日期2005-12
- 单位郑州大学
