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

A branch and bound algorithm to minimize the sum of maximum earliness and tardiness in single machine
-
ششمين كنفرانس بين المللي مهندسي صنايع
6th International Industrial Engineering Conference

doi
Article type
Conference
https://people.iut.ac.ir/en/moslehi/content/1659769