Scheduling in an assembly-type production chain with batch transfer
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
151 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
143 | en_US |
dc.citation.volume |
35 | en_US |
dc.citation.woscount |
18 | |
dc.contributor.author |
Lin, B. M. T. | en_US |
dc.contributor.author |
Cheng, T. C. E. | en_US |
dc.contributor.author |
Chou, A. S. C. | en_US |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2014-12-08T15:14:22Z | |
dc.date.available |
2014-12-08T15:14:22Z | |
dc.date.issued |
2007-04-01 | en_US |
dc.description.abstract |
This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second stage of a flowshop for processing the component parts in batches. Whenever a batch is formed on the second-stage machine, a constant setup time is required. The objective is to minimize the makespan. In this study we establish the strong NP-hardness of the problem for the case where all the jobs have the same processing time on the second-stage machine. We then explore a useful property, based upon which a special case can be optimally solved in polynomial time. We also study several heuristic algorithms to generate quality approximate solutions for the general problem. Computational experiments are conducted to evaluate the effectiveness of the algorithms. (c) 2005 Elsevier Ltd. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.omega.2005.04.004 | en_US |
dc.identifier.issn |
0305-0483 | en_US |
dc.identifier.journal |
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.omega.2005.04.004 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/10968 | |
dc.identifier.wosnumber |
WOS:000241089300002 | |
dc.language.iso |
en_US | en_US |
dc.subject |
two-stage flowshop | en_US |
dc.subject |
batch scheduling | en_US |
dc.subject |
makespan | en_US |
dc.subject |
NP-hardness | en_US |
dc.subject |
heuristics | en_US |
dc.title |
Scheduling in an assembly-type production chain with batch transfer | en_US |
dc.type |
Article | en_US |
檔案
- 000241089300002.pdf (211.9 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Lin, B. M. T., Cheng, T. C. E., & Chou, A. S. C. (2007). Scheduling in an assembly-type production chain with batch transfer. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 35(2), 143–151. https://doi.org/10.1016/j.omega.2005.04.004
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/10968