Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJARAI.2012.010111
Article Published in International Journal of Advanced Research in Artificial Intelligence(IJARAI), Volume 1 Issue 1, 2012.
Abstract: The solution of the Machines’ Time Scheduling Problem (MTSP) is a hot point of research that is not yet matured, and needs further work. This paper presents two algorithms for the solution of the Machines’ Time Scheduling Problem that leads to the best starting time for each machine in each cycle. The first algorithm is genetic-based (GA) (with non-uniform mutation), and the second one is based on particle swarm optimization (PSO) (with constriction factor). A comparative analysis between both algorithms is carried out. It was found that particle swarm optimization gives better penalty cost than GA algorithm and max-separable technique, regarding best starting time for each machine in each cycle.
Ghoniemy S, El-sawy A. A., Shohla M. A. and Gihan E. H. Ali, “ The Solution of Machines’ Time Scheduling Problem Using Artificial Intelligence Approaches” International Journal of Advanced Research in Artificial Intelligence(IJARAI), 1(1), 2012. http://dx.doi.org/10.14569/IJARAI.2012.010111