1997
DOI: 10.1016/s0377-2217(96)00320-7
|View full text |Cite
|
Sign up to set email alerts
|

Optimal clustering of frequency-constrained maintenance jobs with shared set-ups

Abstract: Since maintenance jobs often require one or more set-up activities, joint execution or clustering of maintenance jobs is a powerful instrument to reduce shut-down costs. We consider a clustering problem for frequency-constrained maintenance jobs, i.e. maintenance jobs that must be carried out with a prescribed (or higher) frequency. For the clustering of maintenance jobs with identical, so-called common set-ups, several strong dominance rules are provided. These dominance rules are used in an efficient dynamic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2000
2000
2018
2018

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 23 publications
(9 citation statements)
references
References 7 publications
(6 reference statements)
0
7
0
Order By: Relevance
“…Many authors have considered clustering of maintenance on components that each use a periodic maintenance policy. Older examples are Wildeman et al (1997) and Van Dijkhuizen and Van Harten (1997), while a newer examples include Levi et al (2014), Zhang and Yang (2015) and Barron (2015). Only few articles consider clustering of maintenance on components that each use a condition- To the best of our knowledge, the only work in which the maintenance program is optimized for a complete system that consists of components with different maintenance policies, is the PhD thesis of Zhu (2015).…”
Section: Literaturementioning
confidence: 99%
“…Many authors have considered clustering of maintenance on components that each use a periodic maintenance policy. Older examples are Wildeman et al (1997) and Van Dijkhuizen and Van Harten (1997), while a newer examples include Levi et al (2014), Zhang and Yang (2015) and Barron (2015). Only few articles consider clustering of maintenance on components that each use a condition- To the best of our knowledge, the only work in which the maintenance program is optimized for a complete system that consists of components with different maintenance policies, is the PhD thesis of Zhu (2015).…”
Section: Literaturementioning
confidence: 99%
“…For this reason, it would be interesting to investigate such complexity issues as part of future research. A first step in this direction has already been taken by Telha [19,Section 4.5], who proved that the problem of computing an optimal cyclic policy is in fact integer-factorization hard, even for the special case of path-additive costs (see Section 5.1, Example 1) on a dependency tree with only three components.…”
Section: Computational Hardnessmentioning
confidence: 99%
“…An integer programming formulation is then used to find the best cyclic policy. van Dijkhuizen and van Harten proposed a combinatorial algorithm for the same model. For instances with a single common setup activity (i.e., when the underlying dependency tree is a star), they developed a polynomial‐time dynamic programming algorithm to compute the optimal solution.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The grouping maintenance within a short-term planning horizon [19,20,21] does not guarantee the grouping performance within long-term horizon. While the grouping maintenance within long-term planning horizon [22,23] does not allow to dynamically update the maintenance planning. The grouping maintenance based on rolling horizon therefore has received a lot of attention from the research community since it holds the advantages of both the short-term and long-term maintenance planning.…”
Section: Introductionmentioning
confidence: 99%