工件允许拆分加工的单机排序问题（英文）

作者：申惠军; 耿志超^*

来源：数学季刊, 2022, 37(04): 412-421.

DOI：10.13371/j.cnki.chin.q.j.m.2022.04.009

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.

• 单位
  郑州大学