Minimize the Makespan in Flow Shop Scheduling Problems Using African Wild Dog Algorithm

This paper considers ‘n’ jobs ‘m’ machines flow shop scheduling problems. Most real world scheduling problems are NP-hard in nature. The objective of this paper is to find minimum makespan in a serial multiple machines manufacturing system and all the jobs are flow in one pass manner. Generally, processing of ‘n’ jobs by ‘m’ machines is solved by Gantt chart method, which gives an active feasible schedule. The proposed African Wild Dog Algorithm is capable of providing better/optimal result than the approximation results