Hybrid Flow-Shop Scheduling Problem Based on Genetic Algorithm

被引：0

作者：

Rong, Zhang ^{[1
]}

机构：

[1] Dalian Vocat & Tech Coll, Dept Mech Engn, Dalian 116037, Liaoning, Peoples R China

来源：

PROCEEDINGS OF THE 2017 2ND INTERNATIONAL CONFERENCE ON MATERIALS SCIENCE, MACHINERY AND ENERGY ENGINEERING (MSMEE 2017) | 2017年 / 123卷

关键词：

Job shop scheduling problem; Material flow; Genetic algorithm; Hybrid flow-shop scheduling problem;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In order to solve the job shop scheduling problem which includes disordered material flow and lopsided load of equipment, the thesis has done some research on how to apply in genetic algorithm on hybrid flow-shop scheduling problem. And the thesis also has illustrated the method of realization from a company of producing engine of automobile.

引用

页码：1703 / 1706

页数：4

共 9 条

[1]

Chen Z., 2007, THESIS

[2] An efficient constructive heuristic for flowtime minimisation in permutation flow shops [J].

Framinan, JM ;

Leisten, R .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2003, 31 (04) :311-317

[3]

Garey M.R., 1976, MATH OPER RES, V1, P17

[4]

Ling Wang, 2003, JOB SHOP SCHEDULING

[5] An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs [J].

Rajendran, C ;

Ziegler, H .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 103 (01) :129-138

[6]

Tang Hengyong, 2002, SORTING INTRO

[7]

Wanc C, 1997, EUR J OPER RES, V96, P636

[8]

Wang X.-P, 2002, Genetic Algorithm: Theory, Application, and Software Implementation, P68

[9]

Wu Y., 2002, THESIS

← 1 →