Maintenance scheduling problems as benchmarks for constraint algorithms

The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the electric power industry: optimally scheduling preventive maintenance of power generating units within a power plant. We sho...

Celý popis

Podrobná bibliografia

Vydané v:	Annals of mathematics and artificial intelligence Ročník 26; číslo 1-4; s. 149 - 170
Hlavní autori:	Frost, Daniel, Dechter, Rina
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Springer Nature B.V 01.02.1999
Predmet:	Algorithms Machine learning Maintenance management Optimization Power plants Preventive maintenance Schedules Scheduling Search algorithms Task scheduling
ISSN:	1012-2443, 1573-7470
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!