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


Stochastically minimizing the makespan in flow shops
Authors:R D Foley  S Suresh
Institution:Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061
Abstract:In this article, we are concerned with scheduling stochastic jobs in a flowshop with m machines and zero intermediate storage. We assume that there are n - 2 identically distributed and 2 fast stochastic jobs. Roughly, the main result states that the makespan is stochastically minimized by placing one of the fast jobs first and the other last.
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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