Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
复制标题
DOI：
10.1016/j.apm.2010.03.014
复制
发表时间：
2010-11
影响因子：
5
通讯作者：
Caimin Wei;Ji-Bo Wang
中科院分区：
文献类型：
--
作者：
Caimin Wei;Ji-Bo Wang
研究了具有成组技术(GT)和恶化作业的单机排序问题。我们考虑这样一种情况：加工时间是开始时间的简单线性函数。调度问题的两个目标分别是最小化完工时间的平方加权和和等待时间的平方和。我们还提供了多项式时间算法来解决这些问题。
This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. We consider the case of jobs whose processing times are a simple linear function of their starting time. The two objectives of scheduling problems are to minimize the weighted sum of squared completion times and the weighted sum of squared waiting times, respectively. We also provide polynomial time algorithms to solve these problems.