CAJ | 학술논문

针对具有退化工件的排序模型，考虑了单机排序和两台机器流水作业的工期窗口安排问题，在这一模型中，工件的加工时间是与其开工时间和退化率有关的一个线性函数。目标是找到一个最优排序和确定工期窗口的开始时间及大小以便最小化所有工件的费用函数，费用函数由四部分组成：提前、延误、工期窗口开始时间和工期窗口大小。对所研究的单机问题，详细地讨论了符合现实情况的几种类型问题，并得到了问题的最优解；对两台机器流水作业问题，给出了多项式算法。
침대구유퇴화공건적배서모형，고필료단궤배서화량태궤기류수작업적공기창구안배문제，재저일모형중，공건적가공시간시여기개공시간화퇴화솔유관적일개선성함수。목표시조도일개최우배서화학정공기창구적개시시간급대소이편최소화소유공건적비용함수，비용함수유사부분조성：제전、연오、공기창구개시시간화공기창구대소。대소연구적단궤문제，상세지토론료부합현실정황적궤충류형문제，병득도료문제적최우해；대량태궤기류수작업문제，급출료다항식산법。
This paper is devoted to a scheduling problem with simple linear deterioration, that is, the processing time of a job is a simple linear function of its starting time and its deterioration rate.We consider the common due-window assignment problem for the single machine and two machine flow shop.The goal is to schedule the jobs and the due-window so as to minimize the highest cost among all the jobs.The objective function contains four cost components:earliness, tardiness, due-window starting time and size.By analyzing the properties of the optimal schedule, we obtain the due-window starting time and size.For the single machine and two-machine flow shop problems, we present a polynomial time solution respectively.Moreover, some special cases of the single machine are also discussed in detail.