计算机工程与应用2016，Vol.52Issue(14)：32-36,5.DOI:10.3778/j.issn.1002-8331.1408-0157
最小化误工工件个数的两代理单机排序问题
Two-agent scheduling on single machine to minimize number of tardy jobs
摘要
Abstract
In this paper, two scheduling problems for two-agent scheduling are considered. One is to minimize total tardiness of agent A , while the number of late jobs must be kept less than or equal to a fixed value. Another is to minimize total weighted completion times of agent A , while the number of late jobs must be kept less than or equal to a fixed value, where the jobs of agent A satisfy the anti-agreeable relation. Some properties of the optimal schedule are provided for the two problems, and it presents pseudo-polynomial time algorithms of the proposed problem, respectively.关键词
排序/两个代理/拟多项式时间算法/动态规划Key words
scheduling/two-agent/pseudo-polynomial time algorithm/dynamic programming分类
信息技术与安全科学引用本文复制引用
张新功,王慧,柏世坤..最小化误工工件个数的两代理单机排序问题[J].计算机工程与应用,2016,52(14):32-36,5.基金项目
国家自然科学基金（No.61302180，No.11401065）；中国博士后基金（No.2013M540698，No.2014T70854）；重庆市教委自然科学基金（No.KJ120624，No.KJ130606）；重庆市自然科学基金（No.cstc2014jcyjA00003）；重庆师范大学重点项目基金（No.2011XLZ05）。 （）
