关于单机双代理可拒绝排序的一个注记（英文）

作者：张利齐^*; 周松涛; 录岭法

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

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

In a recent paper, Feng et al. [5](Two-agent scheduling with rejection on a single machine. Appl. Math. Model. 39(2015) 1183-1193) studied some two-agent scheduling problems with rejection on a single machine. The authors showed that all problems are NP-hard and then provided four dynamic programming algorithms. Unfortunately, we observe that some mistakes are contained in the two dynamic programming algorithms. In this note, we first show by a counter-example that the above two algorithms are incorrect. Furthermore, we also provide two new dynamic programming algorithms to solve the same problems.

• 单位
  郑州大学