Cost Optimization Problem of Hybrid Flow-shop Based on PSO Algorithm
Han ZH(韩忠华); Ma Xiaofu; Yao LL(姚丽丽); Shi HB(史海波)
2011
会议名称2011 3rd International Conference on Computer Design and Applications(ICCDA 2011)
会议日期May 27-29, 2011
会议地点Xi'an, China
关键词hybrid flow-shop scheduling problem(HFSP) particle swarm optimization (PSO) genetic algorithm(GA) cost optimization
页码410-415
中文摘要A PSO-algorithm-based job scheduling method that takes production cost as optimization object is presented in this paper. The cost optimization model of hybrid flow-shop, in which production cost is considered as an optimal factor, is constructed. PSO is used to take global optimization, make the production task assignment and find which machine the jobs should be assigned at each stage, which is also called the process route of the job. After that the local assignment rules are used to determine the job’s starting time and processing sequence at each stage. The total production cost converted by time-based scheduling results is comprehensively considering the processing cost, waiting costs, and the products storage costs. The numerical results show the effectiveness of the algorithm after comparing between multi-group programs.
产权排序1
会议主办者IEEE
会议录2011 3rd International Conference on Computer Design and Applications(ICCDA 2011)
会议录出版者IEEE
会议录出版地Piscataway, NJ
语种英语
ISBN号978-1-4244-9489-7
内容类型会议论文
源URL[http://ir.sia.cn/handle/173321/7687]  
专题沈阳自动化研究所_自动化系统研究室
推荐引用方式
GB/T 7714
Han ZH,Ma Xiaofu,Yao LL,et al. Cost Optimization Problem of Hybrid Flow-shop Based on PSO Algorithm[C]. 见:2011 3rd International Conference on Computer Design and Applications(ICCDA 2011). Xi'an, China. May 27-29, 2011.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace