排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
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 i... 相似文献
1