点击次数：

论文类型：期刊论文

发表时间：2014-07-01

发表刊物：SCIENTIFIC WORLD JOURNAL

收录刊物：SCIE、PubMed、Scopus

卷号：2014

页面范围：242107

ISSN号：1537-744X

摘要：m unrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waiting) time, the total machine load, the total absolute differences in completion (waiting) times on all machines, and total resource cost. If the number of machines is a given constant number, we propose a polynomial time algorithm to solve the problem.