Possibly Related Publications

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]
• Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion TimeXing Chai, Lingfa Lu, Wenhua Li, Liqi Zhang. apjor, 35(6):1850048, 2018. [doi]
• A Best Possible Online Algorithm for the Parallel-Machine Scheduling to Minimize the Maximum Weighted Completion TimeWenjie Li. apjor, 32(4), 2015. [doi]
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-timeWenhua Li, Jinjiang Yuan. ipl, 111(18):907-911, 2011. [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.
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machineXing Chai, Wenhua Li, Yuejuan Zhu. anor, 298(1):79-93, 2021. [doi]