Discrete harmony search algorithm for the no wait flow shop scheduling problem with makespan criterion

Authors:
Kaizhou Gao;Shengxian Xie;Hua Jiang;Junqing Li
Affiliations:
Computer School, Liaocheng University, Liaocheng, China;Computer School, Liaocheng University, Liaocheng, China;Computer School, Liaocheng University, Liaocheng, China;Computer School, Liaocheng University, Liaocheng, China
Venue:
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
Year:
2011

Citing 12
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
New heuristics for no-wait flowshops to minimize makespan

Computers and Operations Research
Some local search algorithms for no-wait flow-shop problem with makespan criterion

Computers and Operations Research
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 DE-based approach to no-wait flow-shop scheduling

Computers and Industrial Engineering
Optimal scheduling of multiple dam system using harmony search algorithm

IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
Harmony search algorithm for solving Sudoku

KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
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
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation
Approximative procedures for no-wait job shop scheduling

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a discrete harmony search (DHS) algorithm for solving no-wait flow shop scheduling problems with makespan criterion. Firstly, a harmony is represented as a discrete job permutation and three heuristic methods are proposed to initialize the harmony memory. Secondly, by dynamically regrouping mechanism, the harmony memory is divided into several groups for sharing information reciprocally. Thirdly, to stress the balance between the global exploration and local exploration, a variable neighborhood search algorithm is developed and embedded in the DHS algorithm. Computational simulation results based on the well-known benchmarks and statistical performance comparisons are provided. Computational results and comparison show the effectiveness of the presented DHS algorithm in solving the no-wait flow shop scheduling with makespan criterion.