摘要
考虑了在加工时间错位限制下的含有退化工件的重新排序问题,其中退化工件指工件的实际加工时间是关于工件开工时间的一个线性函数.考虑了在原始工件的加工时间错位限制下的单机最小化总延误时间的重新排序问题,证明了该问题能在多项式时间内解决.
This paper considers the rescheduling problem of the processing time disruption and containing the linear dete- riorating, the linear deteriorating jobs refers to the actual processing time of a job is a linear function of the starting time for deteriorating job. Consider the single - machine rescheduling problem to minimize the total lateness under a limit of process- ing time disruption for original job. It is proved that the problem can be solved in polynomial time.
出处
《周口师范学院学报》
CAS
2014年第2期35-39,共5页
Journal of Zhoukou Normal University
基金
国家自然科学基金资助项目(No.1112634)
重庆市教委自然科学基金资助项目(No.KJ120624)
关键词
时间错位
重新排序
总延误时间
退化工件
time disruption
rescheduling
total lateness
deteriorating jobs
