Genetic algorithm based multi-objective scheduling in a flow shop with batch processing machines

被引：2

作者：

Lei, Deming ^{[1
]}

Zhang, Qiongfang ^{[1
]}

Cheng, Wen ^{[1
]}

Wang, Tao ^{[1
]}

Guo, Xiuping ^{[2
]}

机构：

[1] Wuhan Univ Technol, Univ Springfield, Sch Automat, Wuhan, Hubei, Peoples R China

[2] Southwest Jiaotong Univ, Sch Econ & Management, Dept Management Sci & Engn, Chengdu, Sichuan, Peoples R China

来源：

2010 8TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA) | 2010年

关键词：

Genetic algorithm; Flow shop; Batch processing machine; Multi-objective optimization; External archive; INCOMPATIBLE JOB FAMILIES; MINIMIZING MAKESPAN; SIZES;

D O I：

10.1109/WCICA.2010.5554035

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, the problem of minimizing makespan and the total tardiness in a flow shop with batch processing machines (BPM) is considered and an efficient genetic algorithm (GA) is presented, in which job permutation is the only optimization object and the solution of problem can be directly obtained using the permutation. To obtain a set of non-dominated solutions, a rank and the weighted objective based binary tournament selection and an external archive updating strategy are also adopted. The proposed GA is finally tested and the computational results show its promising performance on multi-objective scheduling of flow shop with BPM.

引用

页码：694 / 699

页数：6

共 15 条

[1]

DAMODARAN P, J INTEL MAN IN PRESS

[2] Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms [J].

Damodaran, Purushothaman ;

Manjeshwar, Praveen Kumar ;

Srihari, Krishnaswami .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 103 (02) :882-891

[3] A fast and elitist multiobjective genetic algorithm: NSGA-II [J].

Deb, K ;

Pratap, A ;

Agarwal, S ;

Meyarivan, T .

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197

[4] Learning effective dispatching rules for batch processor scheduling [J].

Geiger, Christopher D. ;

Uzsoyz, Reha .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (06) :1431-1454

[5]

GOLDBERG DE, 1985, 1 INT C GEN ALG, P154

[6] A hybrid genetic heuristic for scheduling parallel batch processing. machines with arbitrary job sizes [J].

Kashan, Ali Husseinzadeh ;

Karimi, Behrooz ;

Jenabi, Masoud .

COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (04) :1084-1098

[7] Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families [J].

Koh, SG ;

Koo, PH ;

Kim, DC ;

Hur, WS .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2005, 98 (01) :81-96

[8] Multi-objective production scheduling: a survey [J].

Lei, Deming .

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 43 (9-10) :926-938

[9] Bicriterion scheduling with equal processing times on a batch processing machine [J].

Liu, L. L. ;

Ng, C. T. ;

Cheng, T. C. E. .

COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (01) :110-118

[10] A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families [J].

Malve, Sujay ;

Uzsoy, Reha .

COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) :3016-3028

← 1 2 →