A realistic variant of bi-objective unrelated parallel machine scheduling problem: NSGA-II and MOACO approaches

详细信息    查看全文

• 作者：Mojtaba Afzalirad ; Javad Rezaeian ; ^{j_rezaeian@ustmb.ac.ir}
• 关键词：Unrelated parallel machine scheduling ; Machine eligibility restrictions ; Precedence constraints ; Non-dominated sorting genetic algorithm ; Multi-objective ant colony optimization
• 刊名：Applied Soft Computing
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：50
• 期：Complete
• 页码：109-123
• 全文大小：1586 K
• 卷排序：50

文摘

In this study a realistic bi-objective unrelated parallel machine scheduling problem is considered. This problem has been inspired from block erection scheduling problem in a shipyard. Conventional (NSGA-II) and new approach of BicriterionAnt algorithm are proposed to solve this problem. A new approach of Taguchi method is used to calibrate the parameters of the algorithms. The results indicate that the proposed (MOACO) is more reliable against (NSGA-II) in solving the test problems.