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


Single machine scheduling under potential disruption
Authors:Chung-Yee Lee  Gang Yu
Institution:a Department of Industrial Engineering and Logistics Management, The Hong Kong University of Science and Technology, Hong Kong
b Dell Inc., One Dell Way, Round Rock, TX 78682, USA
Abstract:We provide optimal algorithms to solve a new scheduling problem in which there is a possibility that a disruption will happen at a particular time and last for a period of time with a certain probability. The objective functions are the expected total weighted completion times and the expected maximum tardiness, respectively.
Keywords:Machine scheduling  Disruption management
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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