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


Approximability of two-machine no-wait flowshop scheduling with availability constraints
Authors:T.C.Edwin Cheng  Zhaohui Liu
Affiliation:a Department of Management, The Hong Kong Polytechnic University, Kowloon, Hong Kong SAR, Hong Kong, China
b Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China
Abstract:We consider in this paper the two-machine no-wait flowshop scheduling problem in which each machine may have an unavailable interval. We present a polynomial time approximation scheme for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap.
Keywords:Scheduling   Approximation scheme
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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