完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHuang, Ting-Chihen_US
dc.contributor.authorLin, Bertrand M. T.en_US
dc.date.accessioned2014-12-08T15:32:32Z-
dc.date.available2014-12-08T15:32:32Z-
dc.date.issued2013-09-01en_US
dc.identifier.issn0020-7543en_US
dc.identifier.urihttp://dx.doi.org/10.1080/00207543.2013.784418en_US
dc.identifier.urihttp://hdl.handle.net/11536/22788-
dc.description.abstractThis paper considers a two-stage three-machine differentiation flow shop that comprises a common machine at stage 1 and two independent dedicated machines at stage 2. Two types of jobs are to be processed. All jobs must visit the stage-1 machine, and then the jobs of each type proceed to their dedicated machine for stage-2 processing. The stage-1 machine processes the jobs in batches, each of which, whenever formed, requires a constant setup time. The objective is to find a schedule that attains the minimum makespan. While the problem is strongly NP-hard, we investigate the case where the processing sequences of the two types of jobs are given and fixed. A polynomial-time dynamic programming algorithm is designed to solve this problem. We then deploy this algorithm to compute the lower bounds of the general problem.en_US
dc.language.isoen_USen_US
dc.subjectflow shop schedulingen_US
dc.subjectmass customizationen_US
dc.subjectschedulingen_US
dc.subjectmakespanen_US
dc.titleBatch scheduling in differentiation flow shops for makespan minimisationen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/00207543.2013.784418en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF PRODUCTION RESEARCHen_US
dc.citation.volume51en_US
dc.citation.issue17en_US
dc.citation.spage5073en_US
dc.citation.epage5082en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000323920500003-
dc.citation.woscount3-
顯示於類別:期刊論文


文件中的檔案:

  1. 000323920500003.pdf

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