Batch scheduling in differentiation flow shops for makespan minimisation
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
5082 | en_US |
dc.citation.issue |
17 | en_US |
dc.citation.spage |
5073 | en_US |
dc.citation.volume |
51 | en_US |
dc.citation.woscount |
3 | |
dc.contributor.author |
Huang, Ting-Chih | en_US |
dc.contributor.author |
Lin, Bertrand M. T. | en_US |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2014-12-08T15:32:32Z | |
dc.date.available |
2014-12-08T15:32:32Z | |
dc.date.issued |
2013-09-01 | en_US |
dc.description.abstract |
This 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.identifier.doi |
10.1080/00207543.2013.784418 | en_US |
dc.identifier.issn |
0020-7543 | en_US |
dc.identifier.journal |
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1080/00207543.2013.784418 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/22788 | |
dc.identifier.wosnumber |
WOS:000323920500003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
flow shop scheduling | en_US |
dc.subject |
mass customization | en_US |
dc.subject |
scheduling | en_US |
dc.subject |
makespan | en_US |
dc.title |
Batch scheduling in differentiation flow shops for makespan minimisation | en_US |
dc.type |
Article | en_US |
檔案
- 000323920500003.pdf (223.9 KB, Adobe PDF)
所屬典藏: 期刊論文