A multi-objective hybrid discrete harmony search algorithm for lot-streaming flow shop scheduling problem

Authors:
Hong-Yan Han
Affiliations:
College of Mathematics Science, Liaocheng University, Liaocheng, China
Venue:
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Year:
2011

Citing 3
Cited 0

A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Computers and Operations Research
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems

Computers and Operations Research
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a multi-objective discrete harmony search algorithm (MDHS) is proposed to slove the lot-streaming flow shop scheduling problem with respect to the two objectives of makespan and total flow time. In the MDHS algorithm, the harmonies are represented as discrete job permutations, and an efficient initialization scheme, which is based on the famous NEH heuristic, is presented to construct the an initial solution in harmony memory. In addition, a local search approach based on insertion operator is embedded to improve the efficiency of the MDHS algorithm. Through the analysis of computational results, the proposed algorithm is superior to NEH heuristic algorithm.