Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms

被引：167

作者：

Damodaran, Purushothaman ^{[1
]}

Manjeshwar, Praveen Kumar ^{[1
]}

Srihari, Krishnaswami ^{[1
]}

机构：

[1] SUNY Binghamton, Dept Syst Sci & Ind Engn, Elect Mfg Res & Serv, Binghamton, NY 13902 USA

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2006年 / 103卷 / 02期

关键词：

heuristics; batch-processing machines; scheduling; genetic algorithms;

D O I：

10.1016/j.ijpe.2006.02.010

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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.

引用

页码：882 / 891

页数：10