Title of article
A NOVEL B AND B ALGORITHM FOR A UNRELATED PARALLEL MACHINE SCHEDULING PROBLEM TO MINIMIZE THE TOTAL WEIGHTED TARDINESS0
Author/Authors
Tavakkoli-Moghaddam, R. university of tehran - College of Engineering - Department of Industrial Engineering and Center of Excellence for Intelligence Based Experimental Mechanics, تهران, ايران , Aramon-Bajestani, M. university of tehran - College of Engineering - Department of Industrial Engineering and Center of Excellence for Intelligence Based Experimental Mechanics, تهران, ايران
From page
269
To page
286
Abstract
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.
Keywords
Parallel Machines Scheduling , Sequence , Dependent Setup Times , Total Weighted Tardiness , Branch , And , Bound Algorithm
Journal title
International Journal of Engineering
Journal title
International Journal of Engineering
Record number
2563512
Link To Document