一类带折扣加权总完工时间单机排序问题

The single scheduling problem of minimum total completion times with discounted weight

讨论了工件加工时间和排列中位置相关的单机排序问题.对工件加工时间和位置相关的两个线性模型pi(v)=ai-biv和pi(v)=aiv-b进行了讨论,目标函数是带折扣的加权总完工时间.并且对工件加工时间与给定权值之间具有一致关系的某些情况给出了最优算法.

<Abstrcat>In this paper we study a single machine scheduling problem in which the processing time of a job is dependent on its position in a sequence.Two linear processing time functions used to model the job processing times characterized by position-dependent are discussed,that is p_i(v)=a\-i-b\-iv and p\-i(v)=a\-iv^(-b).The objective function is to minimize the total completion times with discounted weight.Optimal algorithms for the job processing times with given weights are agreeable in several cases are discussed respectively.