| dc.creator (作者) | Chen, Chun-Lung ;Chen, Chuen-Lung | en_US |
| dc.creator (作者) | 陳春龍 | - |
| dc.date (日期) | 2009-05 | en_US |
| dc.date.accessioned | 17-一月-2009 16:34:45 (UTC+8) | - |
| dc.date.available | 17-一月-2009 16:34:45 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-一月-2009 16:34:45 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/27355 | - |
| dc.description.abstract (摘要) | This paper considers the flexible flow line problem with unrelated parallel machines at each stage and with a bottleneck stage on the line. The objective of the problem is to minimize the total tardiness. Two bottleneck-based heuristics with three machine selection rules are proposed to solve the problem. The heuristics first develop an indicator to identify a bottleneck stage in the flow line, and then separate the flow line into the upstream stages, the bottleneck stage, and the downstream stages. The upstream stages are the stages ahead of the bottleneck stage and the downstream stages are the stages behind the bottleneck stage. A new approach is developed to find the arrival times of the jobs at the bottleneck stage. Using the new approach, the bottleneck-based heuristics develop two decision rules to iteratively schedule the jobs at the bottleneck stage, the upstream stages, and the downstream stages. In order to evaluate the performance of the bottleneck-based heuristics, seven commonly used dispatching rules and a basic tabu search algorithm are investigated for comparison purposes. Seven experimental factors are used to design 128 production scenarios, and ten test problems are generated for each scenario. Computational results show that the bottleneck-based heuristics significantly outperform all the dispatching rules for the test problems. Although the effective performance of the bottleneck-based heuristics is inferior to the basic tabu search algorithm, the bottleneck-based heuristics are much more efficient than the tabu search algorithm. Also, a test of the effect of the experimental factors on the dispatching rules, the bottleneck-based heuristics, and the basic tabu search algorithm is performed, and some interesting insights are discovered. | - |
| dc.format | application/ | en_US |
| dc.language | en | en_US |
| dc.language | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Computers and Industrial Engineering, 56(4), 1393-1401 | en_US |
| dc.subject (關鍵詞) | Bottleneck; Flexible flow line; Unrelated parallel machines; Dispatching rules; Tabu search algorithm; Total tardiness | - |
| dc.title (題名) | Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1016/j.cie.2008.08.016 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1016/j.cie.2008.08.016 | en_US |
