Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChaukwale, R.-
dc.contributor.authorSowmya, Kamath S.-
dc.identifier.citation2013 15th International Conference on Advanced Computing Technologies, ICACT 2013, 2013, Vol., , pp.-en_US
dc.description.abstractThe problem of efficiently scheduling jobs on several machines is an important consideration when using Job Shop scheduling production system (JSP). JSP is known to be a NP-hard problem and hence methods that focus on producing an exact solution can prove insufficient in finding an optimal resolution to JSP. Hence, in such cases, heuristic methods can be employed to find a good solution within reasonable time. In this paper, we study the conventional ACO algorithm and propose a Load Balancing ACO algorithm for JSP. We also present the observed results, and discuss them with reference to the conventional ACO. It is observed that the proposed algorithm gives better results when compared to conventional ACO. � 2013 IEEE.en_US
dc.titleA modified Ant Colony optimization algorithm with load balancing for job shop schedulingen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.