A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
Publish Year: 1388
نوع سند: مقاله ژورنالی
زبان: English
View: 132
This Paper With 18 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJE-22-7_006
تاریخ نمایه سازی: 18 بهمن 1400
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:
Authors
Reza Tavakkoli-Moghaddam
Industrial Engineering, University of Tehran
M. Aramon-Bajestani
Industrial Engineering, University of Tehran