1. NCCU Academic Hub
  2. 學術產出
  3. 商學院
  4. 期刊論文
  5. Item

學術產出-期刊論文

文章檢視/開啟

書目匯出

Google ScholarTM

政大圖書館

引文資訊

TAIR相關學術產出

題名 Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
作者 陳春龍
Chen, Chun-Lung
貢獻者 資管系
關鍵詞 Bottleneck-based heuristics; Flexible flow line; Unrelated parallel machines
日期 2008
上傳時間 12-二月-2015 14:44:52 (UTC+8)
摘要 This paper develops new bottleneck-based heuristics with machine selection rules to solve the flexible flow line problem with unrelated parallel machines in each stage and a bottleneck stage in the flow line. The objective is to minimize the number of tardy jobs in the problem. The heuristics consist of three steps: (1) identifying the bottleneck stage; (2) scheduling jobs at the bottleneck stage and the upstream stages ahead of the bottleneck stage; (3) using dispatching rules to schedule jobs at the downstream stages behind the bottleneck stage. A new approach is developed to find the arrival times of the jobs at the bottleneck stage, and two decision rules are developed to schedule the jobs on the bottleneck stage. This new approach neatly overcomes the difficulty of determining feasible arrival times of jobs at the bottleneck stage. In order to evaluate the performance of the proposed heuristics, six well-known dispatching rules are examined for comparison purposes. Six factors are used to design 729 production scenarios, and ten test problems are generated for each scenario. Computational results show that the proposed heuristics significantly outperform all the well-known dispatching rules. An analysis of the experimental factors is also performed and several interesting insights into the heuristics are discovered.
關聯 International Journal of Production Research,46(22),6415-6430
資料類型 article
DOI http://dx.doi.org/10.1080/00207540701352102
dc.contributor 資管系-
dc.creator (作者) 陳春龍-
dc.creator (作者) Chen, Chun-Lung-
dc.date (日期) 2008-
dc.date.accessioned 12-二月-2015 14:44:52 (UTC+8)-
dc.date.available 12-二月-2015 14:44:52 (UTC+8)-
dc.date.issued (上傳時間) 12-二月-2015 14:44:52 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/73506-
dc.description.abstract (摘要) This paper develops new bottleneck-based heuristics with machine selection rules to solve the flexible flow line problem with unrelated parallel machines in each stage and a bottleneck stage in the flow line. The objective is to minimize the number of tardy jobs in the problem. The heuristics consist of three steps: (1) identifying the bottleneck stage; (2) scheduling jobs at the bottleneck stage and the upstream stages ahead of the bottleneck stage; (3) using dispatching rules to schedule jobs at the downstream stages behind the bottleneck stage. A new approach is developed to find the arrival times of the jobs at the bottleneck stage, and two decision rules are developed to schedule the jobs on the bottleneck stage. This new approach neatly overcomes the difficulty of determining feasible arrival times of jobs at the bottleneck stage. In order to evaluate the performance of the proposed heuristics, six well-known dispatching rules are examined for comparison purposes. Six factors are used to design 729 production scenarios, and ten test problems are generated for each scenario. Computational results show that the proposed heuristics significantly outperform all the well-known dispatching rules. An analysis of the experimental factors is also performed and several interesting insights into the heuristics are discovered.-
dc.format.extent 137 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) International Journal of Production Research,46(22),6415-6430-
dc.subject (關鍵詞) Bottleneck-based heuristics; Flexible flow line; Unrelated parallel machines-
dc.title (題名) Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines-
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1080/00207540701352102-
dc.doi.uri (DOI) http://dx.doi.org/10.1080/00207540701352102-