The following publications are possibly variants of this publication:
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrivalTsung-Che Chiang, Hsueh-Chien Cheng, Li-Chen Fu. cor, 37(12):2257-2269, 2010. [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]
- 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]
- Algorithms for scheduling incompatible job families on single batching machine with limited capacityBayi Cheng, Junfeng Cai, Shanlin Yang, Xiaoxuan Hu. candie, 75:116-120, 2014. [doi]
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespanRuyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan. orl, 41(3):216-219, 2013. [doi]