A Particle Swarm Optimization Algorithm for Robust Flow-shop Scheduling with Fuzzy Processing Times
This paper discusses a kind of flow-shop scheduling problems (FSSPs) with uncertain processing times. The uncertain processing times are represented by triangular fuzzy numbers. An integrated objective function is designed to embody the schedule bi-criteria, which involves the fuzzy makespan and the robustness of makespan. The robustness of makespan is measured by the spread of makespan. A particle swarm optimization (PSO) algorithm is developed to solve the robust FSSP. Extensive experiments were performed to test the parameters of PSO and to compare the PSO with a genetic algorithm (GA). The computational results show that such a PSO algorithm is effective for our problems and outperforms the GA.
uncertain flow-shop scheduling PSO robustness bi-criteria
Bing Wang Zhen Yang
School of Information Engineering Shandong University at Weihai Weihai, Shandong Province, China
国际会议
2007 IEEE International Conference on Automation and Lofistics
山东济南
英文
2007-08-18（万方平台首次上网日期，不代表论文的发表时间）