Solving Scheduling problems using Selective Breeding Algorithm and Hybrid Algorithm

The n-job, m-machine scheduling problem is one of the general scheduling problems in a system. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems.Scheduling problems are usually solved using heuristics to get optimal or near optimal solutions because problems found in practical applications cannot be solved to optimality using reasonable resources in many cases. In this paper, Selective Breeding Algorithm (SBA) and Hybrid Algorithm (HA) are used for finding optimal for different size benchmark problems. Hybrid Algorithm has Artificial Immune system and shifting bottleneck procedure. The results show that the Selective Breeding algorithm is an efficient and effectivealgorithm that gives better results than other algorithms compared in literature. The proposed algorithm is a good problem-solving technique for scheduling problems.