The following publications are possibly variants of this publication:
- Iterated Local Search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardinessHongyun Xu, Zhipeng Lü, T. C. E. Cheng. scheduling, 17(3):271-287, 2014. [doi]
- The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-HardT. C. Edwin Cheng, C. T. Ng, J. J. Yuan. scheduling, 6(5):483-490, 2003.
- 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.
- 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]
- Single machine batch scheduling problem with family setup times and release dates to minimize makespanJ. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng. scheduling, 9(6):499-513, 2006. [doi]