Stochastic flow shop scheduling with random machine breakdowns
Li SF(李素粉); Zhu YL(朱云龙)
2003
会议名称International Conference on Complexity Analysis and Control for Social, Economical and Biological Systems
会议日期October 8-10, 2004
会议地点Shenyang, China
关键词stochastic scheduling flow shop machine breakdowns genetic algorithms
页码60-68
中文摘要This paper deals with scheduling problems in m machines permutation flow shop subject to random breakdowns. The processing time of each job on each machine is a random variable. The objective is to find a job schedule, which minimizes the expected makespan. The traditional studies on flow shop scheduling based on deterministic flows mostly can't adapt to the dynamic flows, and current works on stochastic scheduling problems with random machine breakdowns only consider one kind of production fashions. But in practical production, there are always many different production fashions in different workshops. Different formulas should be introduced for different production fashions. For improving the efficiency of scheduling scenarios in different workshops, two kinds of methods were advanced to deal with different random breakdowns. Genetic Algorithms were used to search the optimized schedule. Finally, some stochastic numerical examples were employed to illustrate the effectiveness of the algorithms.
收录类别CPCI(ISTP)
产权排序1
会议主办者Natl Nat Sci Fdn China
会议录Complexity Analysis and Control for Social, Economical and Biological Systems
会议录出版者ISCI-INST SCIENTIFIC COMPUTING & INFORMATION
会议录出版地EDMONTON
语种英语
ISBN号1-55195-204-1
WOS记录号WOS:000240942100008
内容类型会议论文
源URL[http://ir.sia.cn/handle/173321/8278]  
专题沈阳自动化研究所_工业信息学研究室_先进制造技术研究室
推荐引用方式
GB/T 7714
Li SF,Zhu YL. Stochastic flow shop scheduling with random machine breakdowns[C]. 见:International Conference on Complexity Analysis and Control for Social, Economical and Biological Systems. Shenyang, China. October 8-10, 2004.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


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