摘要
讨论了单机成组排序问题的加权总完工时间和最大延迟时间的极小化问题,并分别给出了算法.对于单机成组排序误工总数问题,通过构造函数,利用动态规划方法给出其算法.
In this paper, we consider the problems of the minimizing weighted total completion time and the minimizing maximum lateness time, and an algorithm is given respectively. For the problem of minimizing the number of tarday jobs scheduling on a single machine, and using dynamic programming equation , we give its algorithm through the constructor function.
出处
《周口师范学院学报》
CAS
2008年第5期26-28,共3页
Journal of Zhoukou Normal University
关键词
排序问题
成组排序
算法
动态规划方法
scheduling
processed with batch
algrothm
dynamic programming equation
