A branch and bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert

A branch and bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
-

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