Article Title

An Ant Colony Optimization For Job Scheduling To Minimize Makespan Time

Authors

V. SELVI, Associate Professor in M.C.A Dept., M.A.M College of Engineering Siruganur,Trichy .TamilnaduFollow
R. UMARANI, Associate Professor, Sri Saradha college for Women, Salem. Tamilnadu. IndiaFollow

Abstract

This paper deals with the makespan minimization for Job Scheduling . Research on optimization techniques of the Job Scheduling Problem (JSP) is one of the most significant and promising areas of an optimization. Instead of the traditional optimization method, this paper presents an investigation into the use of an Ant Colony optimization (ACO) to optimize the JSP. The numerical experiments of ACO were implemented in a small JSP. In the natural environment, the ants have a tremendous ability to team up to find an optimal path to food resources. An ant algorithm stimulates the behavior of ants. The main objective of this paper is to minimize the makespan time of a given set of jobs and achieved optimal results are encroached.

Recommended Citation

SELVI, V. and UMARANI, R. (2015) "An Ant Colony Optimization For Job Scheduling To Minimize Makespan Time," International Journal of Computer and Communication Technology: Vol. 6: Iss. 1, Article 4.
DOI: 10.47893/IJCCT.2015.1266
Available at: https://www.interscience.in/ijcct/vol6/iss1/4

DOI

10.47893/IJCCT.2015.1266