标题:Bounded parallel-batch scheduling on unrelated parallel machines
作者:Miao, Cuixia ;Zhang, Yuzhong ;Wang, Chengfei
通讯作者:Miao, C
作者机构:[Miao, Cuixia ;Zhang, Yuzhong ;Wang, Chengfei ] School of Operations Research and Management Sciences, Qufu Normal University, Rizhao, Shandong 276826 更多
会议名称:6th International Conference on Algorithmic Aspects in Information and Management, AAIM 2010
会议日期:July 19, 2010 - July 21, 2010
来源:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版年:2010
卷:6124 LNCS
页码:220-228
DOI:10.1007/978-3-642-14355-7_23
摘要:In this paper, we consider the bounded parallel-batch scheduling problem on unrelated parallel machines. Problems Rm|B|F are NP-hard for any objective function F. For this reason, we discuss the special case with pij = pi for i = 1, 2, · · ·,m, j = 1, 2, · · · , n. We give optimal algorithms for the general scheduling to minimize total weighted completion time, makespan and the number of tardy jobs. And we design pseudo-polynomial time algorithms for the case with rejection penalty to minimize the makespan and the total weighted completion time plus the total penalty of the rejected jobs, respectively. © Springer-Verlag Berlin Heidelberg 2010.
收录类别:EI
最新影响因子:0.302
资源类型:会议论文
TOP