具有非线性安装时间和送出时间的单机排序问题

Single-Machine Scheduling Problems with Non-Linear Past-Sequence-Dependent Setup Times and Delivery Times

本文讨论了同时带有非线性安装时间和送出时间的单机排序问题。工件的实际加工时间为与其开始时间和位置有关的函数。工件的安装时间和送出时间均与工件的加工位置有关,还依赖于已加工完成工件的实际加工时间,即p-s-d形式。研究了关于最大完工时间、总完工时间、加权完工时间、总完工时间 次方之和以及最大延误时间的目标函数。分别给出上述问题的最优排序规则。

This paper studies the single machine scheduling problems with both non-linear setup times and delivery times where the actual processing time of a job is given as a function of its starting times and position in a sequence. The setup time and delivery time of a job are proportional to the jobs already processed and its scheduled position, that is, past-sequence-dependent (p-s-d). We consider the objective functions about the makespan, the total completion times, the total weighted completion times, the sum of the -th power of job completion times and the maximum tardiness. We give the optimal scheduling rules of the above problem respectively.