同时具有学习和恶化效应的不同工期指派问题研究

摘要

In this paper we consider the single-machine scheduling problem with the effects of learning and deterioration,where the actual processing times of jobs are defined by functions of their normal processing times,starting times and scheduled positions in a sequence,and each job has a due date.The objective is to determine the optimal due dates and schedule simultaneously to minimize the sum of earliness,tardiness and due date.We show that the problem remains polynomially solvable under the introduction of effects of learning and deterioration, and we propose the algorithm and examples to show how to solve this problem optimally.%讨论工件同时具有学习和恶化效应的单机排序模型，其中工件的实际加工时间是其基本加工时间、开工时间和所排位置的函数，每个工件都有自己的工期。目标是确定工件的加工顺序和工期，使工件的提前成本、延迟成本和工期的机会成本的加权和最小。证明此问题在工件引入学习和恶化效应后，依然多项式时间可解，同时给出了求解算法和实例来说明如何最优的求解这个问题。