No-Wait Flow Shop Scheduling Based on Discrete Harmony Search Algorithm

Qiang Qiang Sun; Bin Dong

doi:10.4028/www.scientific.net/AMM.513-517.1523

Paper Titles

A XML Pattern Match Algorithm of Structural Index
p.1507

Mechanical Arm Active Disturbance Rejection Control Based on Artificial Bee Colony Algorithm
p.1511

LOLAP: A Lightweight OLAP Model
p.1515

The Design of Modern Agriculture Control System Based on Internet of Things
p.1519

No-Wait Flow Shop Scheduling Based on Discrete Harmony Search Algorithm
p.1523

Information Extraction of High-Resolution Remotely Sensed Imagery Based on Object-Oriented Method
p.1527

Research on Information Description Mechanisms for Equipment Maintenance Support Resource Based on Metadata
p.1532

Design of Contents Recommendation Model Based on Gray System Theory
p.1536

Research on User Clustering of Recommended System Based on Fuzzy Clustering
p.1540

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517No-Wait Flow Shop Scheduling Based on Discrete...

No-Wait Flow Shop Scheduling Based on Discrete Harmony Search Algorithm

Abstract:

This paper proposed a discrete harmony search algorithm, named DHS, for solving the no-wait flow shop scheduling problem with the objective to minimize total flowtime. Firstly, the total flowtime is shown. Secondly, a harmony is represented as a discrete job permutation and the well-known NEH method is proposed to initialize the harmony memory. Thirdly, Extensive computational experiments are carried out based on a set of well-known benchmark instances. Computational results show the effectiveness of the DHS algorithm in solving the no-wait flow shop scheduling problem.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

1523-1526

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.1523

Citation:

Cite this paper

Online since:

February 2014

Authors:

Qiang Qiang Sun*, Bin Dong

Keywords:

Flow Shop Scheduling, No-Wait, SDH Heuristic, Total Flowtime

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] B. Liu, L. Wang, An effective hybrid particle swarm optimization for no-wait flow shop scheduling, International Journal of Advanced Manufacturing Technology, 31, (2007), p.1001–1011.

DOI: 10.1007/s00170-005-0277-5

Google Scholar

[2] Q. K. Pan, M. F. Tasgetiren, and Y. C. Liang, A discrete particle swarm optimizatioin algorithm for the no-wait flowshop scheduling problem with makespan criterion, Preceedings of the international Workshop on UK Planning and Scheduling Special interest Group, (2005).

DOI: 10.1109/scis.2007.367698

Google Scholar

[3] M. Sviridenko, Makespan minimization in no-wait flow shops: A polynomial time approximation scheme. SIAM Journal on Discrete Mathematics, vol. 16(2), (2003), p.313–322.

DOI: 10.1137/s0895480100370803

Google Scholar

[4] C. L. Chen, R. V. Neppalli, N. Aljaber, Genetic algorithms applied to the continuous flow shop problem. Computers & Industrial Engineering, vol. 30, (1996), p.919–929.

DOI: 10.1016/0360-8352(96)00042-3

Google Scholar

[5] A. Allahverdi, T. Aldowaisan, No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research, vol. 152, (2004), p.132–147.

DOI: 10.1016/s0377-2217(02)00646-x

Google Scholar