Return to search

Modi fied Genetic Algorithms for the Single Machine Scheduling Problem

In this paper we propose an improved algorithm to search optimal solutions to the single machine total weighted tardiness scheduling problem. We propose using longest common sequence to combine with the random key method. Numerical simulation shows that the scheme we proposed could improve the search efficiency of genetic algorithm in this problem for some cases.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0811111-015121
Date11 August 2011
CreatorsYang, Chih-Wei
ContributorsMay-Ru Chen, Chien-Sen Huang, Tsai-Lien Wong
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811111-015121
Rightsuser_define, Copyright information available at source archive

Page generated in 0.0021 seconds