CAJ | 학술논문

本文考虑具有学习效应和共同交货期的单机排序问题.目标函数是加权超前有奖延误受罚总和.我们的目标是寻找一个最优序使得目标函数的值最小.由于该问题是NP-hard的,我们给出一些特殊情况下多项式时间可解的特例.同时在快速估计下界的基础上给出了分支定界算法来求一般情况下的最有排序.
본문고필구유학습효응화공동교화기적단궤배서문제.목표함수시가권초전유장연오수벌총화.아문적목표시심조일개최우서사득목표함수적치최소.유우해문제시NP-hard적,아문급출일사특수정황하다항식시간가해적특례.동시재쾌속고계하계적기출상급출료분지정계산법래구일반정황하적최유배서.
In this paper,we consider a single-machine scheduling model with a given due date and learning effect processing time.The objective function is the total weighted tardiness penalty and earliness award.Our aim is to find an optimal sequence so as to minimize the objective function.As the problem is N P-hard,we give some polynomial time solvable cases of this problem.A branch and bound algorithm was given for general ease of the problem based on a rapid method for estimating the lower bound.