Minimizing the total flow time for lot streaming flow shop using an effective discrete harmony search algorithm

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 6
Cited 0

Evolutionary algorithms for scheduling m-machine flow shop with lot streaming

Robotics and Computer-Integrated Manufacturing
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Computers and Operations Research
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems

Computers and Operations Research
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms

Expert Systems with Applications: An International Journal
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

Expert Systems with Applications: An International Journal
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

This paper presents a discrete harmony search(DHS) algorithm for solving an n-job,m-machine lot-streaming flowshop scheduling problem(LFSP) with equal-size sublots, the objective is to minimize the total flow time. In the proposed DHS algorithm, The discrete job permutation without any conversion is used in the proposed DHS algorithm. To search for the best sequence,the DHS algorithm uses an effective initialization approach and a novel improvisation strategy. At the same time, an effective local search is embedded .Computational results demonstrate that the proposed DHS algorithm is very effectiveness for the lot-streaming flowshop scheduling problem.