A scalable data structure for real-time estimation of resource availability in build-to-order environments
- 92 Downloads
This paper defines a highly scalable interval index structure called the Temporal Bin tree (TB-tree) that can be embedded in any resource planning application whose algorithms require efficiently estimating either the time that a resource will be available to process a specific task of known length or the net availability of a resource during a specified period of time. It is specifically engineered to meet the real-time response and space efficiency requirements of large-scale resource planning applications that are required for mass customization. Basically, the TB-tree is a binary tree structure that represents availability of a resource across a planning horizon. Representing intervals of availability hierarchically using a tree structure increases the efficiency of search for resource availability when the discretization of time is fine-grained or the planning horizon is long. The tree forms a backbone structure that does not require disruptive rebalancing during update operations, which would mitigate the ability of the tree to respond to queries in real time. Its specific implementation allows for random access at any level of the tree to further improve scalability. An application of planning to real-time promising of order due dates for custom built products provides the context for empirical evaluation. Results of analytical evaluations and simulation experiments clearly demonstrate the scalability of the TB-tree relative to existing index structures in terms of both time and space.
KeywordsMass customization Build-to-order Resource planning Resource availability Due date assignment Index data structures
Unable to display preview. Download preview PDF.
- Aho A.V., Hopcroft J.E., Ullman J.D. (1974) The design and analysis of computer algorithms. Reading, MA, Addison-WesleyGoogle Scholar
- Ammann, A. C., Hanrahan, M. B., & Krishnamurthy, R. (1985). Design of a memory resident DBMS. In Proceedings of the IEEE Spring Computer Conference, San Francisco, CA (pp. 54–57). New York: IEEE Press.Google Scholar
- Chaabouni, M., & Chung, S. M. (1993). The point-range tree: A data structure for indexing intervals. In Proceedings of the 1993 ACM Conference on Computer Science, Indianapolis, IN (pp. 453–460). New York: ACM Press.Google Scholar
- Elmasri R., Wuu G.T., Kouramajian V. (1993) The time index and the monotonic B+ -tree. In: Tansel A.U., Clifford J., Gadia S.K., Jajodia S., Segev A., Snodgrass R.(eds) Temporal databases: Theory, design and implementation. Benjamin/Cummings, Redwood City, CA, pp 433–456Google Scholar
- Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, Boston, MA (pp. 47–57). New York: ACM Press.Google Scholar
- Kouramajian, V., Kamel, I., Elmasri, R., & Waheed, S. (1994). The Time Index+: An incremental access structure for temporal databases. In Proceedings of the Third International Conference on Information and Knowledge Management, Gaithersburg, Maryland (pp. 296–303). New York: ACM Press.Google Scholar
- Lehman, T. J., & Carey, M. J. (1986). A study of index structures for main memory database management systems. In Proceedings of the Twelfth International Conference on Very Large Data Bases, Kyoto, Japan (pp. 294–303). San Francisco, CA: Morgan Kaufmann.Google Scholar
- Rao, J., & Ross, K. A. (1999). Cache conscious indexing for decision-support in main memory. In Proceedings of the 25th International Conference on Very Large Data Bases, Seattle, WA (pp. 78–89). San Francisco, CA: Morgan Kaufmann.Google Scholar
- Rao, J., & Ross, K. A. (2000). Making B+ -trees cache conscious in main memory. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, TX (pp. 475–486). New York: ACM Press.Google Scholar
- Samet H. (1990) The design and analysis of spatial data structures. Addison-Wesley, Reading, MAGoogle Scholar