The following publications are possibly variants of this publication:
- Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy JobsC. T. Ng, T. C. Edwin Cheng, J. J. Yuan. scheduling, 6(4):405-412, 2003.
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobsRubing Chen, Jinjiang Yuan, Yuan Gao. scheduling, 22(5):581-593, 2019. [doi]
- Unary NP-hardness of minimizing the number of tardy jobs with deadlinesJinjiang Yuan. scheduling, 20(2):211-218, 2017. [doi]
- A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy JobsT. C. Edwin Cheng, C. T. Ng, J. J. Yuan. scheduling, 6(6):551-555, 2003.
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late workRuyan He, Jinjiang Yuan, C. T. Ng 0001, T. C. E. Cheng. jco, 41(2):504-525, 2021. [doi]