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...

Full description

Bibliographic Details

Published in:	Annals of mathematics and artificial intelligence Vol. 26; no. 1-4; pp. 149 - 170
Main Authors:	Frost, Daniel, Dechter, Rina
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Nature B.V 01.02.1999
Subjects:	Algorithms Machine learning Maintenance management Optimization Power plants Preventive maintenance Schedules Scheduling Search algorithms Task scheduling
ISSN:	1012-2443, 1573-7470
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!