Optimizing with constraints: A case study in scheduling maintenance of electric power units

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1520, Issue , 1998, Pages 469-

  Frost, Daniel ^a   Dechter, Rina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; ELECTRIC INDUSTRY; MAINTENANCE; OPTIMIZATION; SCHEDULING;

DYNAMIC VARIABLE ORDERING; ELECTRIC POWER INDUSTRIES; MAINTENANCE COST; MAINTENANCE SCHEDULES; MAINTENANCE SCHEDULING; PLANNING PERIOD; POWER GENERATING UNITS; PREVENTATIVE MAINTENANCE;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 52149084039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_40     Document Type: Conference Paper

References (3)

1. J. F. Dopazo and H. M. Merrill. Optimal Generator Maintenance Scheduling using Integer Programming. IEEE Trans. on Power Apparatus and Systems, PAS94(5):1537-1545, 1975.
2. Daniel Frost. Algorithms and Heuristics for Constraint Satisfaction Problems. PhD thesis, University of California, Irvine, CA 92697-3425, 1997.
3. J. Yellen, T. M. Al-Khamis, S. Vemuri, and L. Lemonidis. A decomposition approach to unit maintenance scheduling. IEEE Trans. on Power Systems, 7(2):726-731, 1992.