关键词: 排序, 成组技术, 综合学习效应, 恶化

Abstract: In this paper, we considergroup scheduling problems with deterioration and general learning effects. In our model, the processing time of jobs has general learning effects. For the makespan minimization, we give a polynomial algorithmand prove that the total completion timeminimization is also polynomial solvable under an agreeable condition.

Key words: scheduling, group technology, general learning effect, deterioration