Single machine group scheduling with general linear deterioration to minimize the makespan
Single machine group scheduling with general linear deterioration to minimize the makespan
复制标题
DOI：
10.1007/s00170-008-1667-2
复制
发表时间：
2009-07
期刊：
影响因子：
--
通讯作者：
Ji-Bo Wang;Wen-Jun Gao;Li-Yan Wang;Dan Wang
中科院分区：
文献类型：
--
作者：
Ji-Bo Wang;Wen-Jun Gao;Li-Yan Wang;Dan Wang
在这篇文章中，我们考虑了一类带有成组技术假设的恶化作业的单机排序问题。我们所说的劣化作业和成组技术假设是指成组建立时间和作业加工时间都是其开始时间的递增函数，即成组建立时间和作业加工时间都用函数来描述，这是时间的一般线性函数。调度问题的目标是最小化完工时间。我们证明了当同时考虑一般线性退化和成组技术时，该问题在多项式时间内是可解的。
In this paper, we consider a single machine scheduling problem with deteriorating jobs and group technology assumption. By deteriorating jobs and group technology assumption, we mean that the group setup times and job processing times are both increasing functions of their starting times, i.e., group setup times and job processing times are both described by function, which is a general linear function of time. The objective of the scheduling problem is to minimize the makespan. We show that the problem remains solvable in polynomial time when general linear deterioration and group technology are considered simultaneously.