The following publications are possibly variants of this publication:
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespanCheng He, Hao Lin, Yixun Lin, Ji Tian. cejor, 21(1):177-186, 2013. [doi]
- Serial-batching scheduling with two agents to minimize makespan and maximum costCheng He, Chunqi Xu, Hao Lin. scheduling, 23(5):609-617, 2020. [doi]
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespanCheng He, Yixun Lin, Jinjiang Yuan. TCS, 381(1-3):234-240, 2007. [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]
- 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]
- 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.