Some meta-heuristics for no-wait flow shop problem

被引：0

作者：

Sch. of Computer Sci., Liaocheng Univ., Liaocheng 252059, China ^{[1
]}

不详 ^{[2
]}

机构：

来源：

Jisuanji Jicheng Zhizao Xitong | 2007年 / 5卷 / 967-970期

关键词：

Computer simulation - Encoding (symbols) - Evolutionary algorithms - Heuristic algorithms - Job analysis - Optimization - Scheduling - Threshold logic;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Discrete Particle Swarm Optimization (DPSO), Discrete Differential Evolutions (DDE), Variable Neighborhood Search (VNS) and Threshold Accepting (TA) were proposed for the no-wait flow shop problem with makespan criterion. Both DPSO and DDE adopted the natural encoding scheme based on job permutation and employed newly designed methods to produce new individual. To improve solution quality, 12 hybrid algorithms based on serial structure, embedded structure and collaborative structure were studied. Simulation results based on the well known benchmark suites in the literature showed that hybrid heuristics had better optimization performance.

引用

页码：967 / 970