Complexity results for single-machine scheduling with positional learning effects
檔案
本條目沒有附加檔案。
日期
2007-08-01
類型
期刊名稱
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷期與頁次
第 58 卷第 8 期,頁 1099–1102
ISSN
0160-5682
語言
英文
摘要
This note presents complexity results for a single-machine scheduling problem of minimizing the number of late jobs. In the studied problem, the processing times of the jobs are defined by positional learning effects. A recent paper proposed a polynomial time algorithm for the case with a common due date and conjectured the general problem to be NP-hard. We confirm that the general problem is strongly NP-hard and show that the studied problem remains NP-hard even if there are only two different due-date values.
所屬典藏
期刊論文引用此條目
Lin, B. M. T. (2007). Complexity results for single-machine scheduling with positional learning effects. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 58(8), 1099–1102. https://doi.org/10.1057/palgrave.jors.2602227
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/10464