Abstract
This paper considers the problem of group scheduling under the two kinds of criteria-the minimum total completion time and the minimum weighted mean flow time. It is supposed that jobs are classified into several groups on the basis of group technology (GT). In this group scheduling problem, optimal decision is made as to sequence of group and sequence of jobs in each group. The basic theorems determining the optimal group schedule are proved on a single production stage. On multiple production stage, algorithms determining the optimal group schedule are proposed, and their effectiveness is verified by the numerical experiment.
