Maintenance scheduling problems as benchmarks for constraint algorithms

Abstract

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 show how these scheduling problems can be cast as constraint satisfaction problems and used to define the structure of randomly generated non-binary CSPs. The random problem instances are then used to evaluate several previously studied algorithms. The paper also demonstrates how constraint satisfaction can be used for optimization tasks. To find an optimal maintenance schedule, a series of CSPs are solved with successively tighter cost-bound constraints. We introduce and experiment with an “iterative learning” algorithm which records additional constraints uncovered during search. The constraints recorded during the solution of one instance with a certain cost-bound are used again on subsequent instances having tighter cost-bounds. Our results show that on a class of randomly generated maintenance scheduling problems, iterative learning reduces the time required to find a good schedule.

DOI: 10.1023/A:1018906911996

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@article{Frost1999MaintenanceSP, title={Maintenance scheduling problems as benchmarks for constraint algorithms}, author={Daniel Frost and Rina Dechter}, journal={Annals of Mathematics and Artificial Intelligence}, year={1999}, volume={26}, pages={149-170} }