摘要
The single-machine lot scheduling problem with splittable jobs to minimize the number of tardy jobs has been showed to be weakly NP-hard in the literature.In this paper,we show that a generalized version of this problem in which jobs have deadlines is strongly NP-hard,and also present the results of some related scheduling problems.
作者
申惠军
耿志超
SHEN Hui-jun;GENG Zhi-chao(School of Mathematics and Statistics,Zhengzhou University,Zhengzhou 450001,China)
基金
Supported by National Natural Science Foundation of China(Grant Nos.12071442,11971443,12271491)。
