Two-stage flexible flow shop scheduling subject to fixed job sequences
檔案
本條目沒有附加檔案。
日期
2016-03
系所
期刊名稱
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷期與頁次
第 67 卷第 3 期,頁 506–515
ISSN
0160-5682
語言
英文
摘要
This paper investigates the scheduling problem in a two-stage flexible flow shop, which consists of m stage-1 parallel dedicated machines and a stage-2 bottleneck machine, subject to the condition that n(l) jobs per type l is an element of {1, ..., m} are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage-2 bottleneck machine. The problem under study is proved to be strongly NP-hard. An O(m(2)Pi(m)(l=1)n(l)(2)) dynamic programming algorithm coupled with numerical experiments is presented.
關鍵詞
two-stage flexible flow shopdedicated machinesregular objective functionsfixed job sequencesdynamic programming所屬典藏
期刊論文引用此條目
Hwang, F. J., & Lin, B. M. T. (2016). Two-stage flexible flow shop scheduling subject to fixed job sequences. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 67(3), 506–515. https://doi.org/10.1057/jors.2015.61
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/134168