欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为缩短工件的完工时间,研究目标为极小化最大完工时间的可拆分恒速机排序问题。在这个问题中,对工件拆分方式进行了限制,要求尽量少拆分工件,且拆分后子工件长度不小于给定阀值。该问题是NP难的。借助LPT算法的思想,提出了一个近似算法。多个实例的数值结果表明,本文算法可行、性能良好,能获得好的近似最优解。
英文摘要：
In order to shorten the completion time of the workpiece,a uniform machine scheduling problem with job splitting property to minimize makespan is studied in this paper.The machine scheduling problem,where the size of each section is restricted to be no smaller than a given threshold value,and the number of spited parts should be as small as possible,is a NP-hard problem.An approximate algorithm is developed to solve this problem based on the LPT algorithm.Experimental results show that the proposed algorithm obtains good performance,and results in a good approximate optimum solution.
同期刊论文项目
同项目期刊论文
期刊信息
位置：