Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
839 | en_US |
dc.citation.issue |
6 | en_US |
dc.citation.volume |
63 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Hwang, F. J. | en_US |
dc.contributor.author |
Lin, B. 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:22:33Z | |
dc.date.available |
2014-12-08T15:22:33Z | |
dc.date.issued |
2012-06-01 | en_US |
dc.description.abstract |
This paper discusses a two-stage assembly-type flowshop scheduling problem with batching considerations subject to a fixed job sequence. The two-stage assembly flowshop consists of m stage-1 parallel dedicated machines and a stage-2 assembly machine which processes the jobs in batches. Four regular performance metrics, namely, the total completion time, maximum lateness, total tardiness, and number of tardy jobs, are considered. The goal is to obtain an optimal batching decision for the predetermined job sequence at stage 2. This study presents a two-phase algorithm, which is developed by coupling a problem-transformation procedure with a dynamic program. The running time of the proposed algorithm is O(mn + n(5)), where n is the number of jobs. Journal of the Operational Research Society (2012) 63, 839-845. doi:10.1057/jors.2011.90 Published online 21 September 2011 | en_US |
dc.identifier.issn |
0160-5682 | en_US |
dc.identifier.journal |
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/15955 | |
dc.identifier.wosnumber |
WOS:000303920200012 | |
dc.language.iso |
en_US | en_US |
dc.subject |
assembly flowshop | en_US |
dc.subject |
batch scheduling | en_US |
dc.subject |
fixed sequence | en_US |
dc.subject |
dynamic programming | en_US |
dc.title |
Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence | en_US |
dc.type |
Article | en_US |
檔案
- 000303920200012.pdf (198.1 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Hwang, F. J., & Lin, B. M. T. (2012). Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 63(6). https://ir.lib.nycu.edu.tw/handle/11536/15955
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/15955