On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Ruyan Fu, Ji Tian, Jinjiang Yuan. On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. J. Scheduling, 12(1):91-97, 2009. [doi]

The following publications are possibly variants of this publication:

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]

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]

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]

Unbounded parallel-batch scheduling with drop-line tasksYuan Gao, Jinjiang Yuan, Zhigang Wei. scheduling, 22(4):449-463, 2019. [doi]

Unbounded parallel-batching scheduling with two competitive agentsShisheng Li, Jinjiang Yuan. scheduling, 15(5):629-640, 2012. [doi]

runs on WebDSL