Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion

被引：81

作者：

Gao, Kai-zhou ^{[2
]}

Pan, Quan-ke ^{[1
]}

Li, Jun-qing ^{[2
]}

机构：

[1] Huazhong Univ Sci & Technol, State Key Lab Digital Mfg Equipment & Technol, Wuhan 430074, Peoples R China

[2] Liaocheng Univ, Coll Comp Sci, Liaocheng 252059, Peoples R China

来源：

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | 2011年 / 56卷 / 5-8期

基金：

美国国家科学基金会;

关键词：

No-wait flow shop; Harmony search; Total flowtime; Local search; SWARM OPTIMIZATION ALGORITHM; HEURISTIC ALGORITHMS; BLOCKING; MACHINE;

D O I：

10.1007/s00170-011-3197-6

中图分类号：

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

学科分类号：

080201 [机械制造及其自动化];

摘要：

In this paper, a discrete harmony search algorithm (DHS) is developed for solving the no-wait flow shop scheduling problem with the objective to minimize total flowtime. Firstly, a harmony is represented as a discrete job permutation, and a new heuristic based on the well-known NEH method is proposed to initialize the harmony memory. Secondly, a novel pitch adjustment rule is employed in the improvisation to produce a new harmony. Thirdly, a local search is presented and embedded to enhance the algorithm's local exploitation ability. Extensive computational experiments are carried out based on a set of well-known benchmark instances. Computational results and comparison show the effectiveness of the presented DHS algorithm in solving the no-wait flow shop scheduling with total flowtime criterion.

引用

页码：683 / 692

页数：10

共 43 条

[1]

New heuristics for no-wait flowshops to minimize makespan [J].