A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem

Authors:
Ling Wang;Quan-Ke Pan;M. Fatih Tasgetiren
Affiliations:
Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University, Beijing 100084, China and College of Computer Science, Liaocheng Univer ...;College of Computer Science, Liaocheng University, Liaocheng 252059, PR China;Industrial Engineering Department, Yasar University, Izmir, Turkey
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 5
Cited 5

Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
Minimizing Cycle Time in a Blocking Flowshop

Operations Research
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups

Computers and Operations Research

Bi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects

Computers and Industrial Engineering
Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem

Information Sciences: an International Journal
Harmony search with multi-parent crossover for solving IEEE-CEC2011 competition problems

ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part IV
Optimizing blocking flow shop scheduling problem with total completion time criterion

Computers and Operations Research
Survey A survey on applications of the harmony search algorithm

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value (LPV) rule is proposed to convert continuous harmony vectors into job permutations. Second, an efficient initialization scheme based on the Nawaz-Enscore-Ham (NEH) heuristic is presented to construct the initial harmony memory with a certain level of quality and diversity. Third, harmony search is employed to evolve harmony vectors in the harmony memory to perform exploration, whereas a local search algorithm based on the insert neighborhood is embedded to enhance the local exploitation ability. Moreover, a new pitch adjustment rule is developed to well inherit good structures from the global-best harmony vector. Computational simulations and comparisons demonstrated the superiority of the proposed hybrid harmony search algorithm in terms of solution quality.