SOLUTION OF BLOCKING RESTRICTION FLOW SHOP SCHEDULING PROBLEMS WITH MONKEY SEARCH ALGORITHM

Abstract

There are m-machines and n-jobs in flow shop scheduling problems. All jobs are processed on all machines respectively. Blocking constraint refers to the inability to leave the machine from which the work is subjected to operation when the next machine is full. In this study, it is aimed to solve the problems of blocking restricted flow type scheduling. In the blockage constrained flow type scheduling problem, the monkey search algorithm has been developed to minimize the total flow time. The monkey search algorithm is one of the meta-heuristic algorithms based on the simulation of monkeys' climbing process. In the study, blocking limited flow type scheduling problems and the algorithms used in the solution phase have been defined. Blocking constrained flow type scheduling problems in the literature have been solved by the monkey search algorithm. The results were compared with the solutions in the literature. Monkey search algorithm has been found to be successful in solving blocking limited flow type scheduling problems.