DISCRETE HARMONY SEARCH FOR FLOW-SHOP SCHEDULING

摘要：

　　The recently developed harmony search (HS) algorithm was originally designed for continuous optimization problems and has been successfully applied to some problems of this area.In order to extend its capability in solving the combinatorial optimization problems, such as flow-shop scheduling, two discrete search strategies are proposed in this paper for harmony search.One is a pure discrete harmony search which adopts the basic HS structure with simple discretization, and another employs a revised operator to improve the HS performance.Numerical experiments reveal that the pure discrete harmony search is not as effective for combinatorial optimization problems as it is for the continuous problems.However, with proper modifications, the revised HS can solve the flow-shop problems efficiently and produce even better solutions than the common evolutionary algorithms.

关键词： Harmony Search Discrete Optimization Flow-Shop Scheduling

作者: Jian Wu Hong Zhou

作者单位: School of Economics and Management, Beihang University, Beijing 100191, China

会议类型: 国际会议

会议名称: The 11th International Conference on Industrial Management(第十一届工业管理国际会议)

会议地点: 日本

会议语种:英文

页码: 125-128

在线出版日期: 2012-08-29（万方平台首次上网日期，不代表论文的发表时间）