典型文献
A Note on Single-Machine Lot Scheduling with Splittable Jobs to Minimize the Number of Tardy Jobs
文献摘要：
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
文献出处：
引用格式：
[1]SHEN Hui-jun;GENG Zhi-chao-.A Note on Single-Machine Lot Scheduling with Splittable Jobs to Minimize the Number of Tardy Jobs)[J].数学季刊（英文版）,2022(04):412-421
A类：
Lot,Splittable,Tardy,splittable,tardy,deadlines
B类：
Note,Single,Machine,Scheduling,Jobs,Minimize,Number,single,machine,lot,scheduling,jobs,minimize,number,has,been,showed,weakly,NP,hard,literature,In,this,paper,that,generalized,version,which,have,strongly,also,present,results,some,related,problems
AB值：
0.512959
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
