首页 | 本学科首页   官方微博 | 高级检索  
     检索      

加工时间服从几何分布的流水车间随机排序问题
引用本文:李扬,曾繁慧.加工时间服从几何分布的流水车间随机排序问题[J].辽宁工程技术大学学报(自然科学版),2009,28(3).
作者姓名:李扬  曾繁慧
作者单位:1. 沈阳化工学院,数理系,辽宁,沈阳,110142
2. 辽宁工程技术大学,理学院,辽宁,阜新,123000
基金项目:辽宁省教育厅高等学校科学研究基金资助项目 
摘    要:为了解决使最长加工时间的数学期望最小、工件的加工时间服从几何分布的两阶段流水车间随机调度问题,采用理论分析的方法,分别研究了两阶段静态随机流水车间和动态随机流水车间工件的最优加工顺序.结果表明:在工件的到达时间均为0的两阶段静态随机流水车间、工件的到达时间不一致的两阶段动态随机流水车间两种情况下,由给出的优先规则的不可中断静态优先策略和不可中断动态优先策略是确定使最长加工时间最小的优先策略,并对算法的最优性进行了证明.该成果对正规目标函数的流水车间随机排序问题的解决具有一定的参考价值和指导意义.

关 键 词:流水车间  随机加工时间  几何分布  最长加工时间  优先策略

Stochastic flow shop scheduling with geometric distributed processing times
LI Yang,ZENG Fanhai.Stochastic flow shop scheduling with geometric distributed processing times[J].Journal of Liaoning Technical University (Natural Science Edition),2009,28(3).
Authors:LI Yang  ZENG Fanhai
Institution:1.Department of Mathematics and Physics;Shenyang Institute of Chemical Technology;Shenyang 110142;China;2. College of Science;Liaoning Technical University;Fuxin 123000;China
Abstract:An optimal manufacturing schedule is proposed for a workpiece with geometric distributed manufacturing times in a two-stage flow shop including static random flow shop and dynamic flow shop, which minimizes the expectation of make span. In this study, a dominance relationship for minimizing make span with probability 1 is established in the cases of equal arrival time and different arrival time of jobs with random manufacturing times. Furthermore, non-interruptive static strategy and non-interruptive dynami...
Keywords:flow shop  random manufacturing times  Geometry distribution  make span  priority strategy  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号