Demonstrating Johnson's algorithm via resource-constrained scheduling
檔案
本條目沒有附加檔案。
日期
2017-01-01
類型
期刊名稱
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷期與頁次
第 55 卷,頁 3326–3330
ISSN
0020-7543
語言
英文
摘要
The celebrated Johnson's algorithm to solve the two-machine flowshop scheduling problem to minimise the makespan plays a prominent role in scheduling research. In using resource-constrained scheduling to interpret Johnson's algorithm in teaching scheduling theory and operations management, we have received positive student feedback on the perceived intuition. We demonstrate this idea and show that the resource-constrained scheduling concept also helps simplify the proofs of some classical scheduling results.
所屬典藏
期刊論文引用此條目
Cheng, T. C. E., & Lin, B. M. T. (2017). Demonstrating Johnson's algorithm via resource-constrained scheduling. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 55, 3326–3330. https://doi.org/10.1080/00207543.2017.1314040
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/145427