CAJ | 학술논문

讨论工件同时具有学习和恶化效应的单机排序模型，其中工件的实际加工时间是其基本加工时间、开工时间和所排位置的函数，每个工件都有自己的工期。目标是确定工件的加工顺序和工期，使工件的提前成本、延迟成本和工期的机会成本的加权和最小。证明此问题在工件引入学习和恶化效应后，依然多项式时间可解，同时给出了求解算法和实例来说明如何最优的求解这个问题。
토론공건동시구유학습화악화효응적단궤배서모형，기중공건적실제가공시간시기기본가공시간、개공시간화소배위치적함수，매개공건도유자기적공기。목표시학정공건적가공순서화공기，사공건적제전성본、연지성본화공기적궤회성본적가권화최소。증명차문제재공건인입학습화악화효응후，의연다항식시간가해，동시급출료구해산법화실례래설명여하최우적구해저개문제。
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.