A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents

Wen-Chiung Lee, Jen-Ya Wang, Mei-Chun Lin. A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents. Knowl.-Based Syst., 105:68-82, 2016. [doi]

@article{LeeWL16-0,
  title = {A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents},
  author = {Wen-Chiung Lee and Jen-Ya Wang and Mei-Chun Lin},
  year = {2016},
  doi = {10.1016/j.knosys.2016.05.012},
  url = {http://dx.doi.org/10.1016/j.knosys.2016.05.012},
  researchr = {https://researchr.org/publication/LeeWL16-0},
  cites = {0},
  citedby = {0},
  journal = {Knowl.-Based Syst.},
  volume = {105},
  pages = {68-82},
}