Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

J. A. Hoogeveen, Steef L. van de Velde. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett., 17(5):205-208, 1995. [doi]

@article{HoogeveenV95-1,
  title = {Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time},
  author = {J. A. Hoogeveen and Steef L. van de Velde},
  year = {1995},
  doi = {10.1016/0167-6377(95)00023-D},
  url = {http://dx.doi.org/10.1016/0167-6377(95)00023-D},
  researchr = {https://researchr.org/publication/HoogeveenV95-1},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {17},
  number = {5},
  pages = {205-208},
}