ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

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

Journal: International Journal of Engineering Sciences & Research Technology (IJESRT) (Vol.3, No. 9)

Publication Date:

Authors : ; ;

Page : 306-309

Keywords : s: Scheduling; flow shop; Gantt chart; African Wild Dog Algorithm; Makespan;

Source : Downloadexternal Find it from : Google Scholarexternal


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

Last modified: 2014-10-16 21:10:20