完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, Bertrand M. T.en_US
dc.contributor.authorLin, Y-Yen_US
dc.contributor.authorFang, K-Ten_US
dc.date.accessioned2014-12-08T15:28:44Z-
dc.date.available2014-12-08T15:28:44Z-
dc.date.issued2013-01-01en_US
dc.identifier.issn0925-5273en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.ijpe.2012.08.006en_US
dc.identifier.urihttp://hdl.handle.net/11536/20792-
dc.description.abstractThis paper studies a two-machine flow shop scheduling problem with a supporting precedence relation. The model originates from a real production context of a chemical factory that produces foam-rubber products. We extend the traditional two-machine flow shop by dividing the operations into two categories: supporting tasks and regular jobs. In the model, several different compositions of foam rubber can be mixed at the foam blooming stage, and products are processed at the manufacturing stage. Each job (product) on the second machine cannot start until its supporting tasks (parts) on the first machine are all finished and the second machine is not occupied. The objective is to find a schedule that minimizes the total job completion time. The studied problem is strongly NP-hard. In this paper, we propose a branch-and-bound algorithm incorporating a lower bound and two dominance rules. We also design a simple heuristic and an iterated local search (ILS) algorithm to derive approximate solutions. The performances of the proposed algorithms are examined through computational experiments. (C) 2012 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectPolyurethane foamen_US
dc.subjectFlow shopen_US
dc.subjectPrecedence constraintsen_US
dc.subjectBranch-and-bound algorithmen_US
dc.subjectHeuristicen_US
dc.subjectIterative local searchen_US
dc.titleTwo-machine flow shop scheduling of polyurethane foam productionen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ijpe.2012.08.006en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF PRODUCTION ECONOMICSen_US
dc.citation.volume141en_US
dc.citation.issue1en_US
dc.citation.spage286en_US
dc.citation.epage294en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000312759600026-
dc.citation.woscount0-
顯示於類別:期刊論文


文件中的檔案:

  1. 000312759600026.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。