Genetic Algorithm for Hybrid Flow-shop Scheduling with Parrel Batch Processors

被引：5

作者：

Feng, Haodi ^{[1
]}

Lu, Shenpeng ^{[1
]}

Li, Xiuqian ^{[1
]}

机构：

[1] Shandong Univ, Sch Comp Sci & Technol, Jinan 250100, Peoples R China

来源：

2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II | 2009年

关键词：

D O I：

10.1109/ICIE.2009.87

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In classical flow-shop scheduling problem, each processor can process one job at a time. However in practice, there may be many processors that can process jobs batch by batch. We call these processors batch processors. If the processing time of a batch is equal to the largest processing time among its members, we call such a batch processor parallel batch processor In this paper we study the hybrid flow-shop problem in which the processors are parrel batch processors. This problem is obviously NP-hard. Therefore, we propose a genetic algorithm in this work.

引用

页码：9 / 13

页数：5

共 9 条

[1] Minimizing makespan in a blocking flowshop using genetic algorithms [J].

Caraffa, V ;

Ianes, S ;

Bagchi, TP ;

Sriskandarajah, C .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 70 (02) :101-115

[2] AN APPLICATION OF GENETIC ALGORITHMS FOR FLOW-SHOP PROBLEMS [J].

CHEN, CL ;

VEMPATI, VS ;

ALJABER, N .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 80 (02) :389-396

[3]

Gen M., 1997, GENETIC ALGORITHM EN

[4]

Goldberg D. E., 1985, P 1 INT C GEN ALG TH, P154

[5] Improved genetic algorithm for the permutation flowshop scheduling problem [J].

Iyer, SK ;

Saxena, B .

COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (04) :593-606

[6]

Lenstra J. K., 1977, Annals of Discrete Mathematics, V1, P343, DOI DOI 10.1016/S0167-5060(08)70743-X

[7]

Michalewicz Z., 1996, Genetic Algorithms + Data Structures = Evolution Programs

[8]

Oguz C, 2005, J SCHEDULING, V8, P323, DOI 10.1007/s10951-005-1640

[9] A GENETIC ALGORITHM FOR FLOWSHOP SEQUENCING [J].

REEVES, CR .

COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (01) :5-13

← 1 →