电子学报2011，Vol.39Issue(10)：2454-2458,5.
求解模糊作业车间调度问题的群体邻域搜索算法
Solving Fuzzy Job Shop Scheduling Problems Through Swarm-Based Neighborhood Search Algorithm
摘要
Abstract
This paper presents a swarm-based neighbourhood search algorithm(SNS) to minimize the maximum completion time of fuzzy job shop scheduling problem(FJSSP). SNS uses an ordered operation-based representation, tournament selection and swap operation in which probability is 1 and swap-time is adjusted dynamically. The theoretical analyses on scheduling results show that fuzzy makespan can be used to evaluate the quality of solution. Theoretical analysis and a large number of experiments demon strate that SNS has strong global and local optimization capabilities,faster convergence speed,and promising performance on FJSSP.关键词
模糊作业车间调度/群体邻域搜索/互换Key words
fuzzy job shop scheduling/ swarm-based neighborhood search/ swap分类
信息技术与安全科学引用本文复制引用
郑友莲,李元香,雷德明..求解模糊作业车间调度问题的群体邻域搜索算法[J].电子学报,2011,39(10):2454-2458,5.基金项目
国家863计划(No.2007AA01Z290) （No.2007AA01Z290）
国家自然科学基金(No.60773009) （No.60773009）
