计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2015年
11期
261-265
,共5页
改进和声搜索算法%置换流水线调度%学习效应
改進和聲搜索算法%置換流水線調度%學習效應
개진화성수색산법%치환류수선조도%학습효응
improved harmony search algorithm%Permutation Flow-shop Scheduling Problem(PFSP)%learning effect
置换流水线调度问题（Permutation Flow-shop Scheduling Problem，PFSP）作为流水线调度问题的子问题，实质是一个著名的组合优化问题，其已被证明了是NP完全问题中最困难的问题之一。带学习效应的PFSP问题是一种更符合实际问题的模型，为了更好地解决此问题，在此提出了一种混合遗传算法和粒子群算法的改进和声搜索算法。对CAR1问题及其学习型调度进行了仿真实验，结果表明所提算法的可行性和有效性。
置換流水線調度問題（Permutation Flow-shop Scheduling Problem，PFSP）作為流水線調度問題的子問題，實質是一箇著名的組閤優化問題，其已被證明瞭是NP完全問題中最睏難的問題之一。帶學習效應的PFSP問題是一種更符閤實際問題的模型，為瞭更好地解決此問題，在此提齣瞭一種混閤遺傳算法和粒子群算法的改進和聲搜索算法。對CAR1問題及其學習型調度進行瞭倣真實驗，結果錶明所提算法的可行性和有效性。
치환류수선조도문제（Permutation Flow-shop Scheduling Problem，PFSP）작위류수선조도문제적자문제，실질시일개저명적조합우화문제，기이피증명료시NP완전문제중최곤난적문제지일。대학습효응적PFSP문제시일충경부합실제문제적모형，위료경호지해결차문제，재차제출료일충혼합유전산법화입자군산법적개진화성수색산법。대CAR1문제급기학습형조도진행료방진실험，결과표명소제산법적가행성화유효성。
Permutation flow-shop scheduling problem, as the sub-problem of pipeline scheduling, is essentially a well-known problem of combination optimization. It has been proved to be one of the most difficult problems in the NP-complete problem. PFSP problems with learning effect is a model which is more corresponding to practical problems. In order to resolve this problem, an improved harmony search algorithm which is the combination of a hybrid genetic algorithm and particle swarm algorithm is proposed. By doing a simulation of the CAR1 problem and its learning schedule, it turns out that the proposed algorithm is feasible and effective.
