Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Retailer-supplier matching: an application of the deferred acceptance algorithm

Retailer-supplier matching: an application of the deferred acceptance algorithm 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Services Operations and Informatics Inderscience Publishers

Retailer-supplier matching: an application of the deferred acceptance algorithm

Loading next page...
 
/lp/inderscience-publishers/retailer-supplier-matching-an-application-of-the-deferred-acceptance-T2LqxeJwpC
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1741-539X
eISSN
1741-5403
DOI
10.1504/IJSOI.2011.041420
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Services Operations and InformaticsInderscience Publishers

Published: Jan 1, 2011

There are no references for this article.