{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:53:18Z","timestamp":1754157198004,"version":"3.41.2"},"reference-count":23,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2009,1,30]],"date-time":"2009-01-30T00:00:00Z","timestamp":1233273600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,1,30]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>Efficient operation of supply chain management (SCM) software is highly dependent on performance of its data structures that are used for data storage and retrieval. Each module in the software should use data structures that are appropriate for the types of operations performed in that module. The purpose of this paper is to develop and introduce an efficient data structure for storage and retrieval of data related to capacity of resources.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>A major aim of supply management systems is timely production and delivery of products. This paper reviews data structures and designs an efficient data structure for storage and retrieval of data that is used in the scheduling module of SCM software.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>This paper introduces a new data structure and search and update algorithms. This data structure can be used in SCM software to record the availability of non\u2010storable resources.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>This is the first paper that discusses the role of data structures in SCM software and develops a data structure that can be used in the scheduling routine of SCM systems. Scheduling is one of the complex modules of SCM software. Some of the special characteristics related to capacity of resources to develop a data structure that can be efficiently searched and updated as part of scheduling routines were used in the new data structure. This data structure is a modified version of threaded height\u2010balanced binary search tree. Each node in the proposed tree has one more key than a node in the ordinary threaded height\u2010balanced binary search tree. The available algorithms in the literature on search and update operations on height\u2010balanced binary search trees are modified to suit the proposed tree.<\/jats:p><\/jats:sec>","DOI":"10.1108\/02635570910926636","type":"journal-article","created":{"date-parts":[[2009,1,24]],"date-time":"2009-01-24T07:01:49Z","timestamp":1232780509000},"page":"138-150","source":"Crossref","is-referenced-by-count":5,"title":["A data structure for supply chain management systems"],"prefix":"10.1108","volume":"109","author":[{"given":"Ali","family":"Ardalan","sequence":"first","affiliation":[]},{"given":"Roya","family":"Ardalan","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022012220244540100_b1","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K. and Thorup, M. (2005), \u201cMaintaining information in fully dynamic trees with top trees\u201d, ACM Transactions on Algorithms, Vol. 1 No. 2, pp. 243\u201064.","DOI":"10.1145\/1103963.1103966"},{"key":"key2022012220244540100_b2","unstructured":"Ardalan, A. (1983), \u201cDevelopment and testing of data structures for the CPM\u2010MRP methodology\u201d, unpublished doctoral dissertation, University of Arizona, Tempe, AZ."},{"key":"key2022012220244540100_b3","unstructured":"Ardalan, A. and Ardalan, R. (2001), \u201cDevelopment of data structures\/file organization methods for managing resources\u201d, Proceedings of the National Meeting of Decision Sciences Institute, San Francisco, CA, USA."},{"key":"key2022012220244540100_b4","doi-asserted-by":"crossref","unstructured":"Austern, M.H., Stroustrup, B., Thorup, M. and Wilkinson, J. (2003), \u201cUntangling the balancing and searching of balanced binary search trees\u201d, Software Practice and Experience, Vol. 33 No. 13, pp. 1273\u201098.","DOI":"10.1002\/spe.564"},{"key":"key2022012220244540100_b5","doi-asserted-by":"crossref","unstructured":"Ball, M.O., Ma, M., Raschid, L. and Zhao, Z. (2002), \u201cSupply chain infrastructures: system integration and information sharing\u201d, SIGMOD Record, Vol. 31 No. 1, pp. 61\u20106.","DOI":"10.1145\/507338.507350"},{"key":"key2022012220244540100_b6","doi-asserted-by":"crossref","unstructured":"Chakraborty, S. and Sharma, S.K. (2007), \u201cEnterprise resource planning: an integrated strategic framework\u201d, International Journal of Management and Enterprise Development, Vol. 4 No. 5, pp. 533\u201051.","DOI":"10.1504\/IJMED.2007.013457"},{"key":"key2022012220244540100_b7","doi-asserted-by":"crossref","unstructured":"Comer, D. (1979), \u201cUbiquitous B\u2010tree\u201d, ACM Computing Surveys, Vol. 11 No. 2, pp. 121\u201037.","DOI":"10.1145\/356770.356776"},{"key":"key2022012220244540100_b8","doi-asserted-by":"crossref","unstructured":"Faisal, M.N., Banwet, D.K. and Shankar, R. (2007), \u201cSupply chain risk management in SMEs: analysing the barriers\u201d, International Journal of Management and Enterprise Development, Vol. 4 No. 5, pp. 588\u2010607.","DOI":"10.1504\/IJMED.2007.013460"},{"key":"key2022012220244540100_b9","doi-asserted-by":"crossref","unstructured":"Huhns, M.N., Stephens, L.M. and Ivezic, N. (2002), \u201cAutomating supply\u2010chain management\u201d, Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: Part 3, Bologna, Italy, pp. 1017\u201024.","DOI":"10.1145\/545056.545061"},{"key":"key2022012220244540100_b10","doi-asserted-by":"crossref","unstructured":"Johnson, T. and Shasha, D. (1993), \u201cThe performance of current B\u2010tree algorithms\u201d, ACM Transactions on Database Systems, Vol. 18 No. 1, pp. 51\u2010101.","DOI":"10.1145\/151284.151286"},{"key":"key2022012220244540100_b11","doi-asserted-by":"crossref","unstructured":"Jones, A., Ivezic, N. and Gruninger, M. (2001), \u201cToward self\u2010integrating software applications for supply chain management\u201d, Information Systems Frontiers, Vol. 3 No. 4, pp. 403\u201012.","DOI":"10.1023\/A:1012864503148"},{"key":"key2022012220244540100_b12","doi-asserted-by":"crossref","unstructured":"Karlton, P.L., Fuller, S.H., Scroggs, R.E. and Kaehler, E.B. (1976), \u201cPerformance of height\u2010balanced trees\u201d, Communications of ACM, Vol. 19 No. 1, pp. 23\u20108.","DOI":"10.1145\/359970.359989"},{"key":"key2022012220244540100_b13","doi-asserted-by":"crossref","unstructured":"Knuth, D.E. (1971), \u201cOptimum binary search trees\u201d, Acta Informatica, Vol. 1, pp. 14\u201025.","DOI":"10.1007\/BF00264289"},{"key":"key2022012220244540100_b14","unstructured":"Knuth, D.E. (1973), The Art of Computer Programming: Sorting and Searching, Vol. 3, Addison\u2010Wesley, Reading, MA."},{"key":"key2022012220244540100_b15","doi-asserted-by":"crossref","unstructured":"Nievergelt, J. (1974), \u201cBinary search trees and file organization\u201d, Computing Surveys, Vol. 6 No. 3, pp. 195\u2010207.","DOI":"10.1145\/356631.356634"},{"key":"key2022012220244540100_b17","doi-asserted-by":"crossref","unstructured":"Perlis, A. and Thornton, C. (1960), \u201cSymbol manipulation by threaded lists\u201d, Communications of ACM, Vol. 3 No. 4, pp. 195\u2010204.","DOI":"10.1145\/367177.367202"},{"key":"key2022012220244540100_b16","doi-asserted-by":"crossref","unstructured":"Perl, Y., Itai, A. and Avni, H. (1978), \u201cInterpolation search \u2013 a log logN search\u201d, Communications of ACM, Vol. 21 No. 7, pp. 550\u20103.","DOI":"10.1145\/359545.359557"},{"key":"key2022012220244540100_b18","doi-asserted-by":"crossref","unstructured":"Raiha, K. and Zweben, S.H. (1979), \u201cAn optimal insertion algorithm for one\u2010sided height\u2010balanced binary search trees\u201d, Communications of ACM, Vol. 22 No. 9, pp. 508\u201012.","DOI":"10.1145\/359146.359149"},{"key":"key2022012220244540100_b19","doi-asserted-by":"crossref","unstructured":"Shapiro, J.F. (2001), \u201cModeling and IT perspectives on supply chain integration\u201d, Information Systems Frontiers, Vol. 3 No. 4, pp. 455\u201064.","DOI":"10.1023\/A:1012876804965"},{"key":"key2022012220244540100_b20","doi-asserted-by":"crossref","unstructured":"Shneiderman, B. (1978), \u201cJump searching: a fast sequential search technique\u201d, Communications of ACM, Vol. 21 No. 10, pp. 831\u20104.","DOI":"10.1145\/359619.359623"},{"key":"key2022012220244540100_b21","doi-asserted-by":"crossref","unstructured":"Singh, N. (2003), \u201cEmerging technologies to support supply chain management\u201d, Communications of the ACM, Vol. 46 No. 9, pp. 243\u20107.","DOI":"10.1145\/903893.903943"},{"key":"key2022012220244540100_b22","doi-asserted-by":"crossref","unstructured":"Verdicchio, M. and Colombetti, M. (2002), \u201cCommitments for agent\u2010based supply chain management\u201d, ACM SIGecom Exchanges, Vol. 3 No. 1, pp. 13\u201023.","DOI":"10.1145\/844331.844334"},{"key":"key2022012220244540100_b23","doi-asserted-by":"crossref","unstructured":"Verwijmeren, M. (2004), \u201cSoftware component architecture in supply chain management\u201d, Computers in Industry, Vol. 53 No. 2, pp. 165\u201078.","DOI":"10.1016\/j.compind.2003.07.004"}],"container-title":["Industrial Management &amp; Data Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/02635570910926636","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/02635570910926636\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/02635570910926636\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:38:08Z","timestamp":1753400288000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/imds\/article\/109\/1\/138-150\/177054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,30]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1,30]]}},"alternative-id":["10.1108\/02635570910926636"],"URL":"https:\/\/doi.org\/10.1108\/02635570910926636","relation":{},"ISSN":["0263-5577"],"issn-type":[{"type":"print","value":"0263-5577"}],"subject":[],"published":{"date-parts":[[2009,1,30]]}}}