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.
Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0811111-015121 |
Date | 11 August 2011 |
Creators | Yang, Chih-Wei |
Contributors | May-Ru Chen, Chien-Sen Huang, Tsai-Lien Wong |
Publisher | NSYSU |
Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
Language | English |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811111-015121 |
Rights | user_define, Copyright information available at source archive |
Page generated in 0.0021 seconds