线性加工时间单机成组排序问题  

Single machine scheduling problem with linear processing times under group technology assumption

作　　者：赵又里[1] 赵传立[2] 

机构地区：[1]中国医科大学图书馆,辽宁沈阳110001 [2]沈阳师范大学数学与系统科学学院,辽宁沈阳110034

出　　处：《沈阳师范大学学报（自然科学版）》2005年第3期236-239,共4页Journal of Shenyang Normal University:Natural Science Edition

基　　金：国家自然科学基金资助项目(10471096).

摘　　要：讨论一类线性加工时间成组排序问题.在这一模型中,工件的加工时间是其开工时间的线性函数,全部工件分成若干组.工件的加工必须满足成组技术限制,同组工件间没有安装时间,各组间有与顺序无关的安装时间.目标函数为极小化最大完工时间.基于对问题的分析,给出了多项式算法.<Abstrcat>This paper considers the single machine scheduling problem with linear processing times under group technology assumption.In this model jobs processing time is a linear function of its starting time.The jobs are partitioned into families.Jobs must be processed under the group technology assumption.No setup time is required between jobs of same family but there are sequence-independent family setup times between.The objective is to minimize the makespan.Based upon the analysis of the problem,the optimal algorithm is presented.

关 键 词：排序 线性加工时间 单机 成组技术 

分 类 号：O223[理学—运筹学与控制论]