A rough set approach for planner evaluation

This paper discusses a rough set approach for evaluating solutions of scheduling problems. Algorithms for solving scheduling problems are planners and the scheduling problems are modelled as constraint satisfaction problems. Conventional approach for the analysis of algorithms often focuses on the time and representational complexities, and assumes an identical cost on all operations. The proposed rough set approach augments conventional approaches for the analysis of algorithms in two ways: 1) it permits the consideration of different costs arising from different operations; and 2) it allows one to define a new utility for a complexity analysis