Single-machine scheduling with three influencing factors for job processing time
首发时间:2012-05-04
Abstract:This paper considers the single machine scheduling problems with time-dependent deterioration and exponential learning effect and the starting time, i.e. the actual processing time of a job depends not only on the processing time of the jobs already processed but also on its scheduled position and its starting time. Here considers a new model and shows that the single machine scheduling problems to minimize the makespan and the total completion time and the sum of the $2$th power of job completion times can be solved by the smallest(normal) processing time first (SPT) rule respectively. It can be proved that the total weighted completion time minimization problem and the maximum lateness minimization problem are polynomially solvable under certain conditions.
keywords: single machine scheduling, deterioration, exponential learning effect, starting time
点击查看论文中文信息
基于三个影响因子的单机排序问题
摘要:本文考虑基于退化、指数学习效应和开始时间三个影响因子的单机排序问题,也就是说工件的实际加工时间不仅与之前加工的工件有关,而且与所处的工件加工位置和开始加工时间有关系。这篇文章给出一个新的模型,并且证明单机排序问题的最小化时间表长、最小化总完工时间及最小化所有工件完工时间的平方和问题能根据SPT规则(最短加工时间优先规则)得到最优解。并且证明在给定的条件下,最小化最大延误和最小化加权总完工时间问题能得到最优解。
论文图表:
引用
No.****
同行评议
共计0人参与
勘误表
基于三个影响因子的单机排序问题
评论
全部评论0/1000