Considering scheduling and preventive maintenance in the flowshop sequencing problem
Considering scheduling and preventive maintenance in the flowshop sequencing problem
复制标题
DOI：
10.1016/j.cor.2005.12.007
复制
发表时间：
2007-11
期刊：
影响因子：
--
通讯作者：
Rubén Ruiz;J. García-Díaz;Concepción Maroto
中科院分区：
文献类型：
--
作者：
Rubén Ruiz;J. García-Díaz;Concepción Maroto
本文的目的是提出一些工具，以便隐含地考虑有关流水作业问题的机器的不同预防性维护策略。这些策略旨在最大限度地提高可用性或在生产期间保持最低水平的可靠性。它提出了一个简单的标准来安排生产序列的预防性维护操作。该标准证明了考虑预防性维护和排序的重要性以及不这样做的后果。所考虑的优化标准在于最小化序列的完工时间或 Cmax。出于预防性维护的考虑，总共对现有启发式和元启发式方法的六种调整进行了评估，并将它们应用于 7200 个实例。所进行的结果和实验表明，现代蚁群算法和遗传算法为这个问题提供了非常有效的解决方案。
The aim of this paper is to propose tools in order to implicitly consider different preventive maintenance policies on machines regarding flowshop problems. These policies are intended to maximize the availability or to keep a minimum level of reliability during the production horizon. It proposes a simple criterion to schedule preventive maintenance operations to the production sequence. This criterion demonstrates the significance of taking into consideration preventive maintenance together with sequencing and the consequences of not doing so. The optimization criterion considered consists in minimizing the makespan of the sequence or Cmax. In total, six adaptations of existing heuristic and metaheuristic methods are evaluated for the consideration of preventive maintenance and they are applied to a set of 7200 instances. The results and experiments carried out indicate that modern Ant Colony and Genetic Algorithms provide very effective solutions for this problem.