DISCRETE SELF-ORGANISING MIGRATING ALGORITHM FOR FLOW SHOP SCHEDULING WITH NO WAIT MAKESPAN

被引：0

作者：

Davendra, Donald ^{[1
]}

Zelinka, Ivan ^{[1
]}

Senkerik, Roman ^{[1
]}

Jasek, Roman ^{[1
]}

机构：

[1] Tomas Bata Univ Zlin, Dept Appl Informat, Zlin 76001, Czech Republic

来源：

PROCEEDINGS OF THE FOURTH GLOBAL CONFERENCE ON POWER CONTROL AND OPTIMIZATION | 2011年 / 1337卷

关键词：

Self Organising Migrating Algorithm; Flow shop; Scheduling;

D O I：

10.1063/1.3592479

中图分类号：

O59 [应用物理学];

学科分类号：

摘要：

This paper introduces a novel discrete Self Organising Migrating Algorithm for the task of flowshop schedul-ing with no-wait makespan. The new algorithm is tested with the small and medium Taillard benchmark problems and the obtained results are competitive with the best performing heuristics in literature.

引用

页码：285 / 289

页数：5

共 5 条

[1] Chang J., 2007, J CHINA U MINING TEC, V17, P0582
[2] Solving the continuous flow-shop scheduling problem by metaheuristics
Fink, A
Voss, S
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (02) : 400 - 414
[3] A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Pan, Quan-Ke
Tasgetiren, M. Fatih
Liang, Yun-Chia
[J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) : 2807 - 2839
[4] BENCHMARKS FOR BASIC SCHEDULING PROBLEMS
TAILLARD, E
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 64 (02) : 278 - 285
[5] Zelinka I., 2000, MEND 6 INT C SOFT CO

← 1 →