1975
DOI: 10.1109/t-pas.1975.31996
|View full text |Cite
|
Sign up to set email alerts
|

Optimal generator maintenance scheduling using integer programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
63
0
1

Year Published

1994
1994
2020
2020

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 180 publications
(64 citation statements)
references
References 4 publications
0
63
0
1
Order By: Relevance
“…The major efforts, perhaps, are those that have been devoted to studying the traditional optimisation-based techniques such as integer programming [1,2,5,6,22], dynamic programming [5,6,9,10] and branch-and-bound [10,15,16,27] which have been proposed to solve small problems. These methods give an exact optimal solution.…”
Section: Important Fields Of Msmentioning
confidence: 99%
“…The major efforts, perhaps, are those that have been devoted to studying the traditional optimisation-based techniques such as integer programming [1,2,5,6,22], dynamic programming [5,6,9,10] and branch-and-bound [10,15,16,27] which have been proposed to solve small problems. These methods give an exact optimal solution.…”
Section: Important Fields Of Msmentioning
confidence: 99%
“…The use of these variables instead of the variables associated with answers to "When does maintenance occur?" reduces the number of variables [1]. The first formulation satisfy the constraints on the periods and duration of maintenance.…”
Section: Problem Descriptionmentioning
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%
“…In fact, the exact solution methods such as branch and bound (Egan et al, 1976;Bagchi et al, 1987;Dorn & Kerr, 1994), dynamic programming (Zurn & Quintana, 1975;Abdul-Razaq & Potts, 1988), integer programming (Dopazo & Merrill, 1975;Edwin & Curtius, 1990) and Lagrangian relaxation (Li, 1997) generate optimal schedules. Practically, these methods are generally inefficient in computational time terms that they are not suggested for scheduling of flexible industrial systems under dynamically changing conditions.…”
Section: Introductionmentioning
confidence: 99%