The following publications are possibly variants of this publication:
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead IntervalWenhua Li, Libo Wang, Hang Yuan. apjor, 40(1), February 2023. [doi]
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookaheadWenhua Li, Zhenkun Zhang, Sufang Yang. ipl, 112(7):292-297, 2012. [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 scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobsWenjie Li, Zhenkun Zhang, Hailing Liu, Jinjiang Yuan. ipl, 112(12):503-508, 2012. [doi]
- 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]
- A note on the scheduling with two families of jobsJ. Yuan, W. P. Shang, Q. Feng. scheduling, 8(6):537-542, 2005. [doi]
- Online scheduling on unbounded parallel-batch machines with incompatible job familiesJi Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan. TCS, 412(22):2380-2386, 2011. [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]