Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling

Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling

This paper proposes a Pareto-based grouping discrete harmony search algorithm (PGDHS) to solve the multi-objective flexible job shop scheduling problem (FJSP). Two objectives, namely the maximum completion time (makespan) and the mean of earliness and tardiness, are considered simultaneously. Firstl...

Full description

Bibliographic Details
Main Authors: Gao, Kai Zhou, Suganthan, P. N., Pan, Q. K., Chua, Tay Jin, Cai, T. J., Chong, C. S.
Other Authors: School of Electrical and Electronic Engineering
Format: Journal Article
Language:English
Published: 2016
Subjects:
Flexible job shop scheduling; Harmony search algorithm; Multi-objective optimization; Local search
Online Access:https://hdl.handle.net/10356/82059
http://hdl.handle.net/10220/39758

Similar Items

Similar Items