Retailer-Supplier Matching: An Application of the Deferred Acceptance Algorithm
Document Type
Article
Publication Date
2011
Keywords
deferred acceptance algorithms, SCM, supply chain management, retailers, retail trade, suppliers, supply chain coordination, mathematical optimisation, optimisation models, newsvendor problem, matching algorithms, contract sizes, ordering sequences, matching applications, stable outcomes, optimal outcomes, services operations, informatics
Digital Object Identifier (DOI)
https://doi.org/10.1504/IJSOI.2011.041420
Abstract
In this paper, we apply matching theory to supply chain coordination. We present mathematical optimisation models similar to the newsvendor problem to provide appropriate conditions for retailer-supplier matching. In particular, our matching algorithm, compared to the general matching theory, has uniquely been affected by contract sizes and ordering sequences. We also study that our matching application guarantees stable and optimal outcomes. Numerical examples with various parameter settings are provided to test the feasibility of the matching algorithms. We find that we can avoid the worst matching case when we use the proposed matching algorithms.
Was this content written or created while at USF?
No
Citation / Publisher Attribution
International Journal of Services Operations and Informatics, v. 6, issue 3, p. 248-258
Scholar Commons Citation
Jung, Taewoo and Kwon, Changhyun, "Retailer-Supplier Matching: An Application of the Deferred Acceptance Algorithm" (2011). Industrial and Management Systems Engineering Faculty Publications. 23.
https://digitalcommons.usf.edu/egs_facpub/23
