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 and B) 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 the composite dispatching rule (ATCS), respectively. We carry out computational experiments and the related results are reported.
Tavakkoli-Moghaddam, R., & Aramon-Bajestani, M. (2009). A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness. International Journal of Engineering, 22(3), 269-286.
MLA
Reza Tavakkoli-Moghaddam; M. Aramon-Bajestani. "A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness". International Journal of Engineering, 22, 3, 2009, 269-286.
HARVARD
Tavakkoli-Moghaddam, R., Aramon-Bajestani, M. (2009). 'A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness', International Journal of Engineering, 22(3), pp. 269-286.
VANCOUVER
Tavakkoli-Moghaddam, R., Aramon-Bajestani, M. A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness. International Journal of Engineering, 2009; 22(3): 269-286.
)
