The following publications are possibly variants of this publication:
- 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.
- 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]
- Batching Machine Scheduling with bicriteria: Maximum Cost and makespanCheng He, Hao Lin, Jinjiang Yuan, Yundong Mu. apjor, 31(4), 2014. [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]
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum latenessJ. J. Yuan, C. T. Ng, T. C. Edwin Cheng. scheduling, 18(2):147-153, 2015. [doi]