Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times
ISSN号:1004-4132
期刊名称:《系统工程与电子技术:英文版》
时间:0
分类:O241.6[理学—计算数学;理学—数学] O171[理学—数学;理学—基础数学]
作者机构:[1]School of Management, Hefei Univ. of Technology, Hefei 230009, P. R. China
相关基金:This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F).
Li Kai was born in 1977. He is currently a Ph. D. candidate in Hefei University of Technology. His current research interests include scheduling and optimization. E-mail: hfutlk@163.com