摘要： 以无等待流水车间(NWFS)总流水时间为优化目标，提出一种改进的和声搜索算法。建立NWFS调度优化的问题模型，设计总流水时间的快速评估方法。采用LPV规则实现离散问题的连续编码，给出改进的和声搜索算法对总流水时间执行优化，达到总流水时间的全局和局部最优。对标准算例做仿真，并在相同条件下与现有算法比较，验证该算法的可行性和有效性。
关键词:
无等待流水车间调度,
和声搜索,
总流水时间,
邻域搜索
Abstract: This paper researches on an improved Harmony Search(HS) for No-Wait Flow Shop(NWFS) schedule problem. The model of NWFS is built and the total flow time is calculated. Large position value rule is used to realize HS solving NWFS schedule. Optimum is improved using variable neighbor search based on interchange neighbor and insert neighbor. Simulations and comparisons based on well-known benchmarks demonstrate the efficiency, effectiveness and robustness of the proposed algorithm.
Key words:
No-Wait Flow Shop(NWFS) schedule,
Harmony Search(HS),
total flow time,
neighbor search
中图分类号:
高开周, 潘全科, 李俊青, 贾保先. 求解NWFS调度的改进和声搜索算法[J]. 计算机工程, 2011, 37(8): 178-180.
GAO Kai-Zhou, BO Quan-Ke, LI Dun-Jing, GU Bao-Xian. Improved Harmony Search Algorithm for No-Wait Flow Shop Schedule[J]. Computer Engineering, 2011, 37(8): 178-180.