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.
- 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.
- Due-date assignment and single machine scheduling with deteriorating jobsT. C. E. Cheng, Liying Kang, C. T. Ng. jors, 55(2):198-203, 2004. [doi]
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteriaYunqiang Yin, Youhua Chen, Kaida Qin, Dujuan Wang. scheduling, 22(3):315-333, 2019. [doi]
- An O(n:::2:::) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardinessZhongjun Tian, C. T. Ng, T. C. Edwin Cheng. scheduling, 9(4):343-364, 2006. [doi]