A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan

Onur Ozturk, Mehmet A. Begen, Gregory S. Zaric. A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan. Int. J. Prod. Res., 55(6):1815-1831, 2017. [doi]

@article{OzturkBZ17,
  title = {A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan},
  author = {Onur Ozturk and Mehmet A. Begen and Gregory S. Zaric},
  year = {2017},
  doi = {10.1080/00207543.2016.1253889},
  url = {https://doi.org/10.1080/00207543.2016.1253889},
  researchr = {https://researchr.org/publication/OzturkBZ17},
  cites = {0},
  citedby = {0},
  journal = {Int. J. Prod. Res.},
  volume = {55},
  number = {6},
  pages = {1815-1831},
}