A1 Journal article (refereed)
A binary branch and bound algorithm to minimize maximum scheduling cost (2014)


Chandra, C., Liu, Z., He, J., & Ruohonen, T. (2014). A binary branch and bound algorithm to minimize maximum scheduling cost. OMEGA - The International Journal of Management Sciences, Volyme 42(Issue 1), 9-15. https://doi.org/10.1016/j.omega.2013.02.005


JYU authors or editors


Publication details

All authors or editors: Chandra, Charu; Liu, Zhixin; He, Jun; Ruohonen, Toni

Journal or series: OMEGA - The International Journal of Management Sciences

ISSN: 0305-0483

eISSN: 1873-5274

Publication year: 2014

Volume: Volyme 42

Issue number: Issue 1

Pages range: 9-15

Publisher: Elsevier

Place of Publication: Amsterdam

Publication country: Netherlands

Publication language: English

DOI: https://doi.org/10.1016/j.omega.2013.02.005

Publication open access: Not open

Publication channel open access:


Keywords: public health service; manufacturing

Free keywords: Scheduling; Branch and bound; Health Service


Contributing organizations

JYU units:
Other organizations:


Ministry reporting: Yes

Reporting Year: 2014

JUFO rating: 2


Last updated on 2021-10-06 at 14:34