The following publications are possibly variants of this publication:
- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobsWenjie Li, Jinjiang Yuan. ol, 8(5):1691-1706, 2014. [doi]
- Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job DeliveryQijia Liu, Jinjiang Yuan. apjor, 35(4):1850026, 2018. [doi]
- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobsWenjie Li, Shisheng Li. ijsysc, 46(4):652-661, 2015. [doi]
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookaheadWenjie Li, Jinjiang Yuan, Jianfa Cao, Hailin Bu. TCS, 410(47-49):5182-5187, 2009. [doi]
- 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.