The following publications are possibly variants of this publication:
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobsRuyan Fu, Ji Tian, Jinjiang Yuan. scheduling, 12(1):91-97, 2009. [doi]
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespanJinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng. scheduling, 14(4):361-369, 2011. [doi]
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machinesPeihai Liu, Xiwen Lu, Yang Fang. scheduling, 15(1):77-81, 2012. [doi]
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespanYuan Gao, Jinjiang Yuan, Chi To Ng, T. C. E. Cheng. eor, 273(1):74-81, 2019. [doi]
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespanJ. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng. TCS, 320(2-3):199-212, 2004. [doi]
- Unbounded parallel-batching scheduling with two competitive agentsShisheng Li, Jinjiang Yuan. scheduling, 15(5):629-640, 2012. [doi]
- Unbounded parallel-batch scheduling with drop-line tasksYuan Gao, Jinjiang Yuan, Zhigang Wei. scheduling, 22(4):449-463, 2019. [doi]
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespanLingfa Lu, Liqi Zhang, Jinjiang Yuan. TCS, 396(1-3):283-289, 2008. [doi]
- Online scheduling on unbounded parallel-batch machines to minimize the makespanJi Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan. ipl, 109(21-22):1211-1215, 2009. [doi]