摘要
本文讨论了一类线性加工时间的成组排序问题,考虑了各工件的加工时间是其开工时间的线性增加函数,同组工件之间连续加工时没有安装时间,各组间工件连续加工时有与顺序无关的安装时间,同组工件必须连续加工.目标函数为极小化最大完工时间和总完工时间.基于对问题的分析,给出了多项式算法.
This paper consider the scheduling problem with linear processing times under group technology assumption. In this paper,jobs processing time is a linear increasing function of its starting time.No setup time is required between jobs of the same group but there are sequence- independent group setup times between jobs from different groups.The objective is to minimize makespan. Based upon the analysis of the problem, the optimal algorithm is presented.
出处
《吉林师范大学学报（自然科学版）》
2008年第3期141-143,共3页
Journal of Jilin Normal University:Natural Science Edition
关键词
线性加工时间
成组排序
时间表长
总完工时间
linear processing times
group schedule
makespan
total completion time
