The Improvement of The Total Flow-Time Problem under The Non-Idle Machine Constraint of Two Machine Open-Shop

摘要：

　　The total flow-time problem of two machine open-shop is NP-hard in strong sense.For the above problem without constrains,an explicit solution is constructed in this paper from the optimal schedule under the non-idle machine constraint,its total flow-time is reductive.The explicit solution under non-idle machine constraints must not be the explicit solution without constraints is proved under the consideration.

关键词： Total flow-time Open-shop Efficient algorithm Scheduling

作者: Liu Lin Liu Weifeng

作者单位: Zhengzhou Institute Of Aeronautical Industry Management Zhengzhou Henan,450015,China

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer Application and System Modeling(2012第二届计算机应用与系统建模国际会议)(ICCASM-2012)

会议地点: 沈阳

会议语种:英文

页码: 411-414

在线出版日期: 2012-07-27（万方平台首次上网日期，不代表论文的发表时间）