A branch and bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times

A branch and bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times
-

doi
#
Article type
Journal
https://people.iut.ac.ir/en/moslehi/content/1631535