A Competent Leadership Algorithm for solving flow shop group scheduling problem

A new heuristic called Competent Leadership Algorithm (CLA) is proposed to minimize the total makespan of flow shop group scheduling problem. Flow shop group scheduling problem consists of two interrelated problems named intra-group scheduling and inter-group scheduling. The first one determines the sequence of parts within each group and the second one is used to obtain the sequence of groups. Therefore, CLA is implemented on both interrelated problems separately. We have evaluated performance of the proposed CLA through 270 randomly generated problems classified under 27 categories of problems. Computational results demonstrate significant reduction in the average makespan. The effectiveness of CLA is also compared with the SVS-algorithm for solving the flow shop group scheduling problem.

کلیدواژه ها:

Group scheduling ، Flow shop ، Scheduling ، Group technology ، Heuristic