期刊
JOURNAL OF SCHEDULING
卷 11, 期 5, 页码 357-370出版社
SPRINGER
DOI: 10.1007/s10951-008-0064-x
关键词
single machine scheduling; deteriorating jobs; learning effect; precedence constraints; priority-generating functions
We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time. We focus on problems of minimizing the makespan or the sum of (weighted) completion times of the jobs. In many situations we show that the objective function is priority-generating, and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable. In other situations we provide counter-examples that show that the objective function is not priority-generating.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据