1983
DOI: 10.1109/tpas.1983.317771
|View full text |Cite
|
Sign up to set email alerts
|

A Computationally Efficient Optimal Maintenance Scheduling Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
57
0
1

Year Published

1996
1996
2020
2020

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 122 publications
(59 citation statements)
references
References 5 publications
1
57
0
1
Order By: Relevance
“…The modern techniques include simulated annealing [5,47,71], genetic algorithms [20,21,56,78,85], heuristics [35,51,77], memetics [8], and hybrids [6,49,50]. Various optimisation studies have also been conducted, including by Billinton and colleague [9], Charles-Owaba [13], Christiaanse [15], El-Sharkh [28], Pan [69], Yamayee and associate [86], and Zunn and Quintana [91,92]. Models have been developed in different situations: proportional intensities [64], full history [43], warranted products [41], finite source [43], uncertainty [54], deregulated system [59], and planning [79].…”
Section: Important Fields Of Msmentioning
confidence: 99%
“…The modern techniques include simulated annealing [5,47,71], genetic algorithms [20,21,56,78,85], heuristics [35,51,77], memetics [8], and hybrids [6,49,50]. Various optimisation studies have also been conducted, including by Billinton and colleague [9], Charles-Owaba [13], Christiaanse [15], El-Sharkh [28], Pan [69], Yamayee and associate [86], and Zunn and Quintana [91,92]. Models have been developed in different situations: proportional intensities [64], full history [43], warranted products [41], finite source [43], uncertainty [54], deregulated system [59], and planning [79].…”
Section: Important Fields Of Msmentioning
confidence: 99%
“…The answer to the first question automatically provides the answer to the second. Several deterministic mathematical methods and heuristic techniques are reported in the literature for solving these problems [1,2,3]. General solution methods are based on integer programming, branch-and-bound techniques, dynamic programming, etc.…”
Section: Problem Descriptionmentioning
confidence: 99%
“…GAs with both generational and steady state approaches yield the optimum solution for small problems when appropriate GA parameters are chosen. Here we present the results of applying a steady state GA to a larger test problem comprising 21 units over a planning period of 52 weeks, which was loosely derived from the example presented in [2] with some simplifications and additional constraints. The data for the test problem is given in Table 1.…”
Section: Ga Approachmentioning
confidence: 99%
“…Thus, it is a mixed integer problem. In early literature, mathematical methods like Integer Programming (IP) [3], Dynamic Programming (DP) [4,5] and Branch and bound approach (B&B) [6] have been used for solving TUMS problem. But these approaches are restricted only to solve small size systems due to "curse of dimensionality" [7].…”
Section: Introductionmentioning
confidence: 99%