CAJ | 학술논문

研究了共同宽容交货期的单机排序问题,即加工时间是位置的函数,所有工件的提前/延误费用相同,共同宽容交货期的开始时间和大小待定,目标函数最小化的总惩罚费用(包括提前、延误、宽容交货期的定位和大小费用四部分).并给出了最优排序的性质,提出了一个多项式时间算法.
연구료공동관용교화기적단궤배서문제,즉가공시간시위치적함수,소유공건적제전/연오비용상동,공동관용교화기적개시시간화대소대정,목표함수최소화적총징벌비용(포괄제전、연오、관용교화기적정위화대소비용사부분).병급출료최우배서적성질,제출료일개다항식시간산법.
We studied a single and machine scheduling problem in which all jobs had a common due window, the processing time was a function of its position, all jobs had common earliness costs and common tardiness penalties, the common due window starting time and the size were decision variables, the objective function was the minimized total penalty costs. Following some properties of the optimal scheduling, a polynomial algorithm was proposed here.