A branch and bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine

A branch and bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
-

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