Ordered flowshop schedule problems solving by bee algorithm

Scheduling is one of the research topics that scholars have studied widely. Because in the global world, scheduling is very important. In this thesis, the problem of scheduling jobs in a flow-shop environment is considered. Bee algorithm is applied in order to find a new approach to the problem.In the first parts of the study, the structure of flow-shop problems, ordered flowshop problems and bee algorithm. The application, which is made to determine the performance of bee algorithm, on ordered flow-shop problems are considered as two different parts as the nature of the ordered type of flow-shop problems.In the first part, the general case, which is the maximum processing time for every job occurred in intermediate machines, are considered. In the second kind of problem, the maximum processing time for every job occurred on the first or last machine, which was the special case, are considered. At the applications, the bees algorithm gave better results than Smith, Panwalker, Dudek algorithm.Keywords: Ordered Flow-Shop Problems, Bee Algorithm