【摘要】 研究带有学习效应、恶化效应和资源分配的单机工期分配问题。该问题以实际生产环境为背景来研究机器的工件调度问题。在此模型中,工件的学习效应与工件的加工位置相关,工件的恶化效应与工件的开始加工时间线性相关,资源分配为凸函数。讨论了在凸性资源分配的情况下,带有学习效应、恶化效应和资源分配的工期分配问题。从CON、SLK、DIF 3种不同的工期分配的角度分析这个问题:针对CON、SLK、DIF 3种不同工期分配问题中的每一种,均提出相应多项式时间内的最优算法。目的是确定最优排序、资源分配量以及工件的加工顺序,使包含提前、延误、工期、总资源消耗的函数最小。通过将其转换为指派问题,证明这些问题都是多项式时间可解的。更多还原

【Abstract】 In this paper, we study a single-machine due date assignment problem with learning effect, deterioration effect and resource allocation. This problem is based on the actual production environment to deal with job scheduling on machines in a just-in-time production environment. In the model, the actual processing time of a job is a function of its position due to learning effects, the actual processing time of a job is a linear function of its starting time due to the deteriorating effects, and the resource allocation is a convex function. For the controllable processing time with linear resource allocation, we consider the problem with learning and deteriorating effect and resource allocation on a single machine. We analyze this problem for the CON, SLK and DIF due date assignment methods: For each of the CON, SLK and DIF due date assignment methods, we presented a polynomial-time optimization algorithm. The objective is to determine the optimal resource allocation, the optimal sequence, the optimal due date to minimize a total costs based on earliness, tardiness, due date and resource consumption. We show that the problem is polynomially solvable by transforming this problem into an assignment problem.更多还原