.png){kind=icon}
返回
Minimizing the total completion time on a parallel machine system with tool changes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2015.11.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the identical parallel machine scheduling problem with periodic tool changes due to wear is addressed under the total completion time minimization objective. Due to machine availability restrictions induced by tool replacement operations, the problem is NP-hard in the strong sense. A mixed integer linear programming (MILP) model has been developed with the aim to provide the global optimum for small-sized test cases. Furthermore, a hybrid metaheuristic procedure based on genetic algorithms has been specifically designed to cope with larger instances. A comprehensive experimental analysis supported by a non-parametric statistical test has been fulfilled to select the best metaheuristic configuration in terms of decoding strategy and parameters driving the search mechanism as well. Then, the proposed optimization procedure has been compared with three alternative methods arising from the relevant literature on the basis of a wide benchmark of test cases. The obtained results, also supported by a proper statistical analysis, demonstrate the effectiveness of the proposed approach for solving the tool change scheduling problem at hand. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Tool change
Unavailability
Metaheuristics
Mixed integer linear programming
Dunn's test
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness具有定期和灵活的定期维护的单机调度，以最大程度地减少迟到
OAAI
OAAI分享收藏Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities具有老化效应和多维护活动的不相关并行机调度
PREAI
分享收藏分享收藏
查看更多内容