加工时间恶化的单机成组排序问题  

Single-machine group scheduling problem with deteriorating processing time

作　　者：孙丽[1] 石国春[2] 陈伯龙[1] 

机构地区：[1]兰州大学数学与统计学院,甘肃兰州730000 [2]兰州工业高等专科学校,甘肃兰州730000

出　　处：《长春大学学报》2008年第10期1-4,共4页Journal of Changchun University

摘　　要：讨论了一类在成组技术条件下,工件的加工时间恶化的单机排序问题。工件的加工时间是开工时间的线性函数,同时工件组的安装时间也是开始安装时刻的线性函数,同组工件间必须连续加工且没有安装时间,不同组工件间连续加工时有安装时间。基于对问题的分析,给出了多项式算法。This paper discusses the single machine scheduling problem with deteriorating processing time under group technology assumption. Job processing time is a linear function of its starting time and the setup time of a group is a linear function of its starting setup time. Jobs of the same group must be processed serially and no setup time is required, while in jobs of different group, setup time is required. Based upon the analysis of the problem,we present the polynomial algorithm.

关 键 词：单机 成组排序 加工时间恶化 

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