Autor:	Ren-Shiang Ho, 何仁祥
Rok vydání:	2003
Druh dokumentu:	學位論文 ; thesis
Popis:	91 In this research, case-based reasoning and genetic algorithms are integrated into the case-based genetic algorithm in order to minimize the total weighted completion time for a single-machine scheduling problem with considering release times. This algorithm first retrieves the analogical cases from the case base then incorporates these analogies into the genetic algorithm to deal with the problem at hand. Finally, case-based genetic algorithm stores the solved problem in the case base for the future use. Extensive experimental results show that this approach outperforms the other three algorithms considered in the paper in both the computation time and the quality of solutions.
Databáze:	Networked Digital Library of Theses & Dissertations
Externí odkaz:	http://ndltd.ncl.edu.tw/handle/30515395195509114677 Zobrazit plný text záznamu