Scheduling jobs with chain precedence constraints and deteriorating jobs
Scheduling jobs with chain precedence constraints and deteriorating jobs
复制标题
DOI：
10.1057/jors.2010.120
复制
发表时间：
2011-09
影响因子：
3.6
通讯作者：
Ji-Bo Wang;Jian-Ji Wang;P. Ji
中科院分区：
文献类型：
--
作者：
Ji-Bo Wang;Jian-Ji Wang;P. Ji
本文考虑一类工件退化的单机排序问题。所谓恶化工件，我们的意思是工件的处理时间是其执行开始时间的简单线性函数。对于带链优先约束的工件，证明了带强链和弱链的加权完工时间平方和极小化问题都可以在多项式时间内求解.
In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polynomial time, respectively.