| dc.contributor | 資管系 | |
| dc.creator (作者) | Chen, Chun-Lung;Chen, Chuen-Lung | |
| dc.creator (作者) | 陳春龍 | zh_TW |
| dc.date (日期) | 2006 | |
| dc.date.accessioned | 21-Jul-2015 15:06:11 (UTC+8) | - |
| dc.date.available | 21-Jul-2015 15:06:11 (UTC+8) | - |
| dc.date.issued (上傳時間) | 21-Jul-2015 15:06:11 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/76748 | - |
| dc.description.abstract (摘要) | The problem considered in this paper is a flexible flow line with a multiple serial stages, where there are one or more unrelated parallel machines at each stage and there exists a bottleneck stage in the system. The objective of the scheduling problem is to minimize makespan. A bottleneck-based tabu search algorithm is proposed to solve the problem. In order to achieve maximum effectiveness and efficiency of the tabu search algorithm, an efficient bottleneck-focused initial solution and a candidate list strategy are examined in the algorithm. To evaluate the performance of the suggested tabu search algorithm, a traditional tabu search algorithm is investigated for comparison purposes and computational experiments are performed on randomly generated test problems. Results show that the proposed bottleneck-based tabu search algorithm performs well. | |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006, Pages 568-574 | |
| dc.subject (關鍵詞) | Bottleneck; Computational experiment; Effectiveness and efficiencies; Flexible flow line; Makespan; Tabu search algorithms; Traditional Tabu searches; Unrelated parallel machines; Industrial engineering; Learning algorithms; Scheduling algorithms; Simulated annealing; Tabu search; Problem solving | |
| dc.title (題名) | A tabu search algorithm for a flexible flow line with unrelated parallel machines and with a bottleneck stage | |
| dc.type (資料類型) | conference | en |
