Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ International Transa...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
International Transactions in Operational Research
Article . 2025 . Peer-reviewed
License: CC BY
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2026
Data sources: zbMATH Open
DBLP
Article . 2026
Data sources: DBLP
versions View all 3 versions
addClaim

A simheuristic‐based algorithm for the stochastic long‐term maintenance scheduling problem

A simheuristic-based algorithm for the stochastic long-term maintenance scheduling problem
Authors: Diego G. Coelho; Marcone J. F. Souza; Luciano Perdigão Cota;

A simheuristic‐based algorithm for the stochastic long‐term maintenance scheduling problem

Abstract

AbstractThis work addresses the problem of assigning preventive maintenance jobs in a 52‐week planning horizon. Given a set of machines that need preventive maintenance, a set of maintenance jobs in these machines, a set of work teams, and a planning horizon, the problem consists of assigning each job to a work team in a given instant of the planning horizon, aiming to minimize the cost with work teams and the cost of performing the unscheduled jobs using outsourced teams. We propose an iterated local search (ILS)‐based algorithm specialized for this problem. Using real instances, the ILS algorithm achieved the best results in 81% of the instances, outperforming literature algorithms. However, these algorithms only treat the deterministic version of the problem and do not consider the uncertainty in the job duration that may occur in an industry environment. Not considering this aspect can produce an inefficient schedule with many unscheduled jobs. So, this work also proposes a simheuristic‐based algorithm (SIM‐ILS) capable of capturing this issue. We tested it in three scenarios, which differ in the level of uncertainty regarding the job duration, and compared their results with those provided by the stochastically evaluated ILS solutions. SIM‐ILS found the best solution in 61% of the tests. Therefore, the SIM‐ILS can be used to support decision‐making in different industrial environments, from environments with low variability in job duration to those with high variability.

Related Organizations
Keywords

metaheuristics, variable neighborhood descent, dispatching rules, simheuristic, long-term preventive maintenance scheduling, iterated local search, Operations research, mathematical programming

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Top 10%
Average
Average
hybrid