Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup time

被引：7

作者：

Kaweegitbundit, Parinya ^{[1
]}

机构：

[1] Rajamangala Univ Technol Rattanakosin, Ind Engn Technol Dept, Fac Ind & Technol, Prachubkirikhan 77110, Thailand

来源：

ADVANCED MANUFACTURING SYSTEMS | 2011年 / 339卷

关键词：

Flow Shop; Heuristic; Sequence dependent setup time;

D O I：

10.4028/www.scientific.net/AMR.339.332

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper considers flow shop scheduling problems with sequence dependent setup time. The makespan criterion has been considered. In this paper presented a comparison of three heuristics for solves this problem. The memetic algorithm, genetic algorithm and NEH heuristic have been compared. In the experimental, the result from memetic algorithm is maximum the best solution. Therefore, the MA heuristic outperforms other heuristic.

引用

页码：332 / 335

页数：4

共 7 条

[1] 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

[2]

Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117

[3]

Garg P., 2009, INT J NETWORK SECURI, V1, P34, DOI 10.48550/arXiv.1004.0574

[4] Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns [J].

Gholami, M. ;

Zandieh, M. ;

Alem-Tabriz, A. .

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 42 (1-2) :189-201

[5]

Nawaz M., 1983, OMEGA INT J MAN SCI, V11

[6]

Sun J.U., 2010, EABR ETLC C P, P519

[7]

Yoon S.H., 2002, EUR J OPER RES, V52, P167

← 1 →