节点文献
工件加工时间是开工时间线性函数的单机排序问题
Single Machine Scheduling Under job Processing time is a Linear Deterioration of its Start time
【摘要】 研究了具有线性恶化工件的单机排序问题,其中线性恶化工件指的是工件的加工时间是开工时间的线性增长函数.在一般情况下,对目标函数为极小化完工时间平方和与极小化总误工数问题分别给出了最优算法.此外,在分段情况下,对目标函数为极小化最大完工时间问题也给出了最优算法.
【Abstract】 We consider the single machine scheduling with linearly deteriorating jobs,where linearly deteriorating jobs mean that the job processing time of a job is a linearly increasing function of its start time.For the general case,optimal algorithms are presented respectively for minimizing the sum of quadratic completion times and the number of tardy jobs.In addition,for the piecewise case,optimal algorithm is also presented for minimizing the maximal makespan.
【关键词】 排序;
单机;
线性函数;
完工时间平方和;
总误工数;
最大完工时间;
【Key words】 scheduling; single machine; linear function; sum of quadratic completion times; number of tardy jobs; maximal makespan;
【Key words】 scheduling; single machine; linear function; sum of quadratic completion times; number of tardy jobs; maximal makespan;
【基金】 辽宁省教育厅科技研究项目资助(20060662)
- 【文献出处】 数学的实践与认识 ,Mathematics in Practice and Theory , 编辑部邮箱 ,2009年03期
- 【分类号】O223
- 【被引频次】3
- 【下载频次】177