Abstract

ABSTRACT In hierarchical planning systems, up to three different kinds of abstraction hierarchies can be used: consistent aggregation and disaggregation are based on aggregation hierarchies. By representation hierarchies, general rules can be represented, and different levels of granularity can be integrated consistently. Finally, problem—solving hierarchies are exploited to solve complex search problems efficiently. While structure and properties of its components impose fixed, distinct levels for aggregation and representation hierarchies (e.g. a “type”, “family”, and “item” level), problem—solving hierarchies are derived from user—defined criticalities of its components and, therefore, are continuous. In order to combine efficient support of interactive, hierarchical search for solutions of complex planning problems with overall consistency control, a database—oriented planning system should comprise not only fixed—level aggregation and representation hierarchies, but also continuous problem—solving hi...

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call