1. NCCU Academic Hub
  2. 學術產出
  3. College of Commerce
  4. Periodical Articles
  5. Item

學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
作者 陳春龍
Chen, Chun-Lung;Chen, Chuen-Lung
貢獻者 資管系
關鍵詞 Bottleneck-based multiple insertion heuristic; Flexible flow line; Bottleneck, Unrelated parallel machines; Makespan
日期 2009-11
上傳時間 12-Feb-2015 14:44:43 (UTC+8)
摘要 This study developed a bottleneck-based heuristic (BBFFL) to solve a flexible flow line problem with a bottleneck stage, where unrelated parallel machines exist in all the stages, with the objective of minimizing the makespan. The essential idea of BBFFL is that scheduling jobs at the bottleneck stage may affect the performance of a heuristic for scheduling jobs in all the stages. Therefore, in BBFFL, a variant of Johnson`s rule is used to develop a bottleneck-based initial sequence generator (BBISG). Then, a bottleneck-based multiple insertion procedure (BBMIP) is applied to the initial sequence to control the order by which jobs enter the bottleneck stage to be the same as that at the first stage. Five experimental factors were used to design 243 different production scenarios and 10 test problems were randomly generated in each scenario. These test problems were used to compare the performance of BBFFL with several well-known heuristics. Computational results show that the BBFFL significantly outperforms all the well-known heuristics.
關聯 Computers & Operations Research,36(11),3073-3081
資料類型 article
DOI http://dx.doi.org/10.1016/j.cor.2009.02.004
dc.contributor 資管系
dc.creator (作者) 陳春龍zh_TW
dc.creator (作者) Chen, Chun-Lung;Chen, Chuen-Lung
dc.date (日期) 2009-11
dc.date.accessioned 12-Feb-2015 14:44:43 (UTC+8)-
dc.date.available 12-Feb-2015 14:44:43 (UTC+8)-
dc.date.issued (上傳時間) 12-Feb-2015 14:44:43 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/73504-
dc.description.abstract (摘要) This study developed a bottleneck-based heuristic (BBFFL) to solve a flexible flow line problem with a bottleneck stage, where unrelated parallel machines exist in all the stages, with the objective of minimizing the makespan. The essential idea of BBFFL is that scheduling jobs at the bottleneck stage may affect the performance of a heuristic for scheduling jobs in all the stages. Therefore, in BBFFL, a variant of Johnson`s rule is used to develop a bottleneck-based initial sequence generator (BBISG). Then, a bottleneck-based multiple insertion procedure (BBMIP) is applied to the initial sequence to control the order by which jobs enter the bottleneck stage to be the same as that at the first stage. Five experimental factors were used to design 243 different production scenarios and 10 test problems were randomly generated in each scenario. These test problems were used to compare the performance of BBFFL with several well-known heuristics. Computational results show that the BBFFL significantly outperforms all the well-known heuristics.
dc.format.extent 130 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) Computers & Operations Research,36(11),3073-3081
dc.subject (關鍵詞) Bottleneck-based multiple insertion heuristic; Flexible flow line; Bottleneck, Unrelated parallel machines; Makespan
dc.title (題名) A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1016/j.cor.2009.02.004en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1016/j.cor.2009.02.004en_US