Khalid, Marzuki and Yusof, Rubiyah (2010) Solving industrial based job shop scheduling problem by distributed micro-GA algorithm with local search. In: KES’2010 14th International Conference on Knowledge Based and Intelligent Information & Engineering Systems, 8-10 September 2010, Cardiff, Wales,UK.
Full text not available from this repository.
Official URL: http://dl.acm.org/citation.cfm?id=1893906
Genetic algorithms (GAs) have been found to be suitable for solving Job-Shop Scheduling Problem (JSSP). However, convergence in GAs is rather slow and thus new GA structures and techniques are currently widely investigated. In this paper, we propose to solve JSSP using distributed micro-genetic algorithm (micro-GA) with local search based on the Asynchronous Colony Genetic Algorithms (ACGA). We also developed a representation for the problem in order to refine the schedules using schedule builder which can change a semi-active schedule to active schedule. The proposed technique is applied to Muth and Thompson's 10×10 and 20×5 problems as well as a real world JSSP. The results show that the distributed micro GA is able to give a good optimal makespan in a short time as compared to the manual schedule built for the real world JSSP.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||Genetic algorithms, JSSP, ACGA|
|Subjects:||T Technology > TK Electrical engineering. Electronics Nuclear engineering|
|Deposited By:||Liza Porijo|
|Deposited On:||19 Sep 2012 03:11|
|Last Modified:||19 Sep 2012 03:11|
Repository Staff Only: item control page