摘要
研究关于共同宽容交货期的单机排序问题.当共同的宽容区间大小给定,位置不固定问题时,该问题证明是NP-hard的,并给出了求解上述问题的动态规划算法.
This paper focuses on the single machine scheduling problem with a common due window. It is proved NP-hard when the width of the due window is given and the site of the due window is free, this paper constructs the corresponding dynamic programming algorithm to slove it.
出处
《曲阜师范大学学报（自然科学版）》
CAS
2007年第4期48-51,共4页
Journal of Qufu Normal University(Natural Science)
基金
山东省教育厅科研基金项目(J06P04)
关键词
排序
宽容区间
超前迟后
动态规划算法
scheduling
common due window
earliness-tardiness
dynamic programming algorithm
