A Novel B and B Algorithm For A Unrelated Parallel Machine Scheduling Problem To Minimize the Total Weighted Tardiness0

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. a new branch-and-bound (b andb) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. the lower and upper bounds are derived through an assignment problem and thecomposite dispatching rule (atcs), respectively. we carry out computational experiments and the related results are reported.