A Search Algorithm for Solving New Models of Consignment and Vendor Management Inventory in Single-Vendor Multiple Buyers Supply Chains
碩士 === 國立交通大學 === 運輸與物流管理學系 === 106 === We formulate new models that implement vendor-managed inventory (VMI) and consignment (CS) policies for single-vendor and multiple buyers supply chains under both power-of-two (PoT) and general-integer (GI) policies in this study. Considering the vendor has li...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/wr6m37 |
| Summary: | 碩士 === 國立交通大學 === 運輸與物流管理學系 === 106 === We formulate new models that implement vendor-managed inventory (VMI) and consignment (CS) policies for single-vendor and multiple buyers supply chains under both power-of-two (PoT) and general-integer (GI) policies in this study. Considering the vendor has limited production capacity, our new models aims to find the optimal cycles and schedules for the vendor to replenish all the buyers so as to minimize the average total costs that includes setup cost, ordering cost and holding cost. We conduct thorough theoretical analysis on our mathematical models and propose the search algorithms for solving the optimal solutions for our models under PoT and GI policies based on our theoretical results. Our numerical experiments demonstrate that our proposed search algorithms are effective for solving the optimal solutions, and the proposed models could obtain VMI&CS policies better than previous studies in the literature. Our sensitivity analysis also provides managerial and strategic insights for the decision maker utilizing VMI&CS policies.
|
|---|