摘要
考虑了在工件具有学习效应的条件下,目标函数为最大完工时间和总完工时间的单机成组排序问题。对这两个问题分别给出了多项式时间算法并证明了其算法的最优性。
In this paper, group scheduling problems on single-machine under the condition of effective learning tools have been considered when the objective functions are the maximum completion time and the total completion time. Polynomial time algorithms for these problems have been presented and proved optimal.
出处
《洛阳理工学院学报（自然科学版）》
2010年第2期72-77,共6页
Journal of Luoyang Institute of Science and Technology：Natural Science Edition
基金
国家自然科学基金资助项目(10671108)
关键词
成组排序
学习效应
最优算法
group scheduling
learning effect
optimal algorithm
