Single-machine scheduling problems with past-sequence-dependent delivery times
Single-machine scheduling problems with past-sequence-dependent delivery times
复制标题
DOI：
10.1016/j.ijpe.2010.03.016
复制
发表时间：
2010-08
影响因子：
12
通讯作者：
Christos Koulamas;George J. Kyparisis
中科院分区：
文献类型：
--
作者：
Christos Koulamas;George J. Kyparisis
本文研究工件交货时间依赖于过去顺序的单机排序问题。需要p-s-d交付时间来消除任何等待时间引起的对作业条件的不利影响（在将作业交付给客户之前），因此它与作业的等待时间成正比。我们表明，单机排序问题的p-s-d交货时间和完成时间相关的标准（如完工时间或总的工作完成时间）或到期日相关的标准（如最大延迟或迟到的工作数量）可以解决简单的多项式时间算法。
We consider single-machine scheduling problems with past-sequence-dependent (p-s-d) job delivery times. The p-s-d delivery time is needed to remove any waiting time-induced adverse effects on the job's condition (prior to delivering the job to the customer) and it is therefore proportional to the job's waiting time. We show that single-machine scheduling problems with p-s-d delivery times and with either completion time-related criteria (such as the makespan or the total job completion time) or due date related criteria (such as the maximum lateness or the number of tardy jobs) can be solved by simple polynomial-time algorithms.