Ant-based job shop scheduling with genetic algorithm for makespan minimisation on identical machines Online publication date: Thu, 19-Jan-2017
by S. Kavitha; P. Venkumar
International Journal of Computer Aided Engineering and Technology (IJCAET), Vol. 9, No. 2, 2017
Abstract: The ant-based optimisation techniques have been used in various problems and could be used in job shop scheduling. The application of ant-based method in job shop scheduling is to find out the sequence of jobs with low time complexity. A new ant-based job shop scheduling algorithm with genetic algorithm is proposed using support, which generates a scheduling of jobs with low waited time for the processes while scheduling the jobs. The support in the new genetic algorithm is inversely proportional to the time complexity. The genetic algorithm with support function is proposed to find out the path in which all the processes have to service with resources. The proposed algorithm produces optimal scheduling in which all processes have to wait minimum time. The problem is to reduce the waiting time of all the processes.
Online publication date: Thu, 19-Jan-2017
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Aided Engineering and Technology (IJCAET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com