A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines

Chengwen Jiao, Wenhua Li, Jinjiang Yuan. A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines. APJOR, 31(4), 2014. [doi]

@article{JiaoLY14,
  title = {A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines},
  author = {Chengwen Jiao and Wenhua Li and Jinjiang Yuan},
  year = {2014},
  doi = {10.1142/S0217595914500304},
  url = {http://dx.doi.org/10.1142/S0217595914500304},
  researchr = {https://researchr.org/publication/JiaoLY14},
  cites = {0},
  citedby = {0},
  journal = {APJOR},
  volume = {31},
  number = {4},
}