Minimizing flow time on a constant number of machines with preemption

Nikhil Bansal. Minimizing flow time on a constant number of machines with preemption. Oper. Res. Lett., 33(3):267-273, 2005. [doi]

@article{Bansal05a,
  title = {Minimizing flow time on a constant number of machines with preemption},
  author = {Nikhil Bansal},
  year = {2005},
  doi = {10.1016/j.orl.2004.07.008},
  url = {http://dx.doi.org/10.1016/j.orl.2004.07.008},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/Bansal05a},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {33},
  number = {3},
  pages = {267-273},
}