期刊
INFORMATION PROCESSING LETTERS
卷 114, 期 8, 页码 399-404出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2014.02.009
关键词
Multi-machine; Scheduling; Position-dependent; Total load
资金
- National Nature Science Foundation of China [71171046]
- College Graduate Research and Innovation Foundation of Jiangsu Province [CXLX0162]
- Scientific Research Foundation of Graduate School of Southeast University [YBJJ1239]
- National Science and Engineering Research Council of Canada [CISE-539050]
In this paper, we investigate multi-machine scheduling problems with general position-dependent effects where the actual processing time functions of jobs are not only associated with the job's position in the sequence but also associated with the machine number and the job number. All the processing time functions of jobs are not restricted to any specific form. The objective is to minimize the total load on machines. Analytical results show that all the considered multi-machine scheduling problems can be optimally solved in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据