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]

Authors

Onur Ozturk

This author has not been identified. Look up 'Onur Ozturk' in Google

Mehmet A. Begen

This author has not been identified. Look up 'Mehmet A. Begen' in Google

Gregory S. Zaric

This author has not been identified. Look up 'Gregory S. Zaric' in Google