A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
Keywords: توالییابی; Sequencing; Single machine; Branch-and-Bound method; Maximum earliness; Maximum tardiness; Idle insert