The flow shop scheduling problems with fuzzy processing times and fuzzy due dates are investigated in this paper. The concepts of earliness and tardiness are interpreted by using the concepts of possibility and necessity measures that were developed in fuzzy sets theory. And the objective function will be taken into account through the different combinations of possibility and necessity measures. The genetic algorithm will be invoked to tackle these objective functions. A new idea based on longest common substring will be introduced at the best-keeping step. This new algorithm reduces the number of generations needed to reach the stopping criterion. Also, we implement the algorithm on CUDA. The numerical experiments show that the performances of the CUDA program on GPU compare favorably to the traditional programs on CPU.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0823110-173701 |
| Date | 23 August 2010 |
| Creators | Huang, Yi-chen |
| Contributors | Zi-Cai Li, Tzon-Tzer Lu, Chien-Sen Huang, Wei-chung Wang, Tsu-Fen Chen |
| 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-0823110-173701 |
| Rights | off_campus_withheld, Copyright information available at source archive |
Page generated in 0.0016 seconds