| dc.contributor | 資管系 | - |
| dc.creator (作者) | 陳春龍 | - |
| dc.creator (作者) | Chen, Chun-Lung;Tzeng, Yeu-Ruey;Chen, Chuen-Lung | - |
| dc.date (日期) | 2015-04 | - |
| dc.date.accessioned | 12-Feb-2015 14:20:22 (UTC+8) | - |
| dc.date.available | 12-Feb-2015 14:20:22 (UTC+8) | - |
| dc.date.issued (上傳時間) | 12-Feb-2015 14:20:22 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/73501 | - |
| dc.description.abstract (摘要) | This paper proposes a population-based heuristic based on the local best solution (HLBS) for the minimization of makespan in permutation flow shop scheduling problems. The proposed heuristic operates through three mechanisms: (i) it introduces a new method to produce a trace-model for guiding the search, (ii) it modifies a filter strategy to filter the solution regions that have been reviewed and guide the search to new solution regions in order to keep the search from trapping into local optima, and (iii) it initiates a new jump strategy to help the search escape if the search is trapped at a local optimum. Computational experiments on the well-known Taillard`s benchmark data sets demonstrate that the proposed algorithm generated high quality solutions when compared to existing population-based search algorithms such as genetic algorithms, ant colony optimization, and particle swarm optimization. | - |
| dc.format.extent | 574103 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Applied Soft Computing,29,75-81 | - |
| dc.subject (關鍵詞) | Scheduling; Heuristic; Permutation flow shop scheduling; Makespan | - |
| dc.title (題名) | A new heuristic based on local best solution for permutation flow shop scheduling | - |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1016/j.asoc.2014.12.011 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1016/j.asoc.2014.12.011 | en_US |
