期刊
APPLIED SOFT COMPUTING
卷 11, 期 8, 页码 5551-5557出版社
ELSEVIER
DOI: 10.1016/j.asoc.2011.05.005
关键词
Parallel-machine Scheduling; Makespan; Resource allocation; Controllable processing time
资金
- National Natural Science Foundation of China [70871032, 90924021, 70971035]
- Anhui Provincial Natural Science Foundation [11040606Q27]
This paper considers the identical parallel machine scheduling problem to minimize the makespan with controllable processing times, in which the processing times are linear decreasing functions of the consumed resource. The total resource consumption is limited. This problem is NP-hard even if the total resource consumption equals to zero. Two kinds of machines, critical machine and non-critical machine, are defined. Some theoretical results are provided. And then, a simulated annealing algorithm is designed to obtain the near-optimal solutions with high quality. To evaluate the performance of the proposed algorithm, we generate the random test data in our experiment to simulate the ingot preheating before hot-rolling process in steel mills. The accuracy and efficiency of the simulated annealing algorithm is tested based on the data with problem size varying from 200 jobs to 1000 jobs. By examining 10,000 randomly generated instances, the proposed simulated annealing algorithm shows an excellent performance in not only the solution quality but also the computation time. (C) 2011 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据