期刊
APPLIED SOFT COMPUTING
卷 58, 期 -, 页码 449-464出版社
ELSEVIER
DOI: 10.1016/j.asoc.2017.04.060
关键词
Condition-based maintenance; Flexible job shop scheduling; Simulation; Imperialist competitive algorithm; Simulated annealing
Maintenance activities have been ignored in many studies on scheduling problems where all machines are assumed to be available without interruption in the planning horizon. However, in realistic situations, they might be unavailable due to preventive maintenance, basic maintenance or unforeseen breakdowns. In this paper, we simulate a condition-based maintenance (CBM) for flexible job shop scheduling problem (FJSP) and consider the combination of Sigmoid function and Gaussian distribution to improve the CBM simulation. This study proposes an improved imperialist competitive algorithm (ICA) for the FJSP scheduling problem with the objective of the makespan minimization. The performance of the proposed algorithm is enhanced with a hybridization of ICA with simulated annealing (SA), after diagnosing standard ICA disadvantages and shortcomings. This ICA also includes a simulation part to handle CBM requirements. Various parameters of the novel ICA are reviewed to calibrate the algorithm with the help of the Taguchi experimental design. Experimental results show the high performance of the novel ICA in comparison with the standard ICA. The obtained results demonstrate that the novel ICA is an effective algorithm for FJSP under CBM. Finally, the performance of ICA is evaluated compared to other popular algorithms. (C) 2017 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据