期刊
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
卷 103, 期 2, 页码 882-891出版社
ELSEVIER
DOI: 10.1016/j.ijpe.2006.02.010
关键词
heuristics; batch-processing machines; scheduling; genetic algorithms
This paper aims at minimizing the makespan for a batch-processing machine. The processing times and the sizes of the jobs are known. The machine can process a batch as long as its capacity is not exceeded. The processing time of a batch is the longest processing time of all the jobs in that batch. This problem is NP-hard and hence a genetic algorithm (GA) approach is proposed. Random instances were used to test the effectiveness of the proposed approach. The results obtained from GA were compared with a simulated annealing approach and a commercial solver. The results indicate that the GA was able to arrive at better makespan with shorter run times. (c) 2006 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据