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

到达时间不同的工件作成组加工时的最大迟后问题
引用本文:孙世杰.到达时间不同的工件作成组加工时的最大迟后问题[J].应用科学学报,1996,14(2):186-190.
作者姓名:孙世杰
作者单位:上海应用数学与计算数学研究所,上海应用数学与计算数学研究所
摘    要:对到达时间不同的工件作成组加工时的加权完工时间和问题,Posner曾给出了一些结果,该文则考虑相应的最大迟后问题。不仅在相同条件下给出了类似结果,而且考虑了更多模式,对这些模式,或给出其最优序、或转化为目前研究已较成熟的问题。

关 键 词:排序  成组加工  不同到达时间  最大迟后

THE MAXIMUM LATENESS OF THE JOBS WITH DIFFERENT RELEASING TIMES AND PROCESSED IN BATCHES
SUN SHIJIE.THE MAXIMUM LATENESS OF THE JOBS WITH DIFFERENT RELEASING TIMES AND PROCESSED IN BATCHES[J].Journal of Applied Sciences,1996,14(2):186-190.
Authors:SUN SHIJIE
Institution:Shanghai Institute of Applied Mathematics and Compution
Abstract:Posner studied the total weighted completion times of the jobs with different releasing times and processed in batches, and obtained good results.This Paper considered the maximum latenss of the jobs with different releasing times and processed in batches too. We not only obtained the results similar to those of Posner for our problem under the same condition, but we also considered more models than Posner. For all these models, we gave the optimal schedule, or changed it into a problem which had been well studied.
Keywords:scheduling  Prbocessd in batches  releasing time  maximum latenss  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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