Asian Journal of Information Technology
ISSN: Online 1993-5994ISSN: Print 1682-3915
Abstract
Job scheduling algorithm is used for assigning the jobs in number of machines that will optimize the overall performance of the running application. In this study, we proposed enhanced Artificial Bee Colony (ABC) algorithm with cross over and mutation operator for job scheduling. The main objective of this algorithm is to obtain a best schedule for jobs which minimizes the makespan value. The processing time of the jobs are generated randomly by using normal, uniform and exponential distribution. The best schedule obtained is then compared with schedule obtained from normal ABC algorithm. The computational results show that the enhanced ABC proves to be a better algorithm than the normal ABC algorithm.
How to cite this article:
V. Santhi and S. Nandhini. An Efficient Algorithm for Job Scheduling Problem-Enhanced Artificial Bee Colony Algorithm.
DOI: https://doi.org/10.36478/ajit.2016.2210.2216
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2016.2210.2216