| Summary: | 碩士 === 國立臺灣大學 === 工業工程學研究所 === 106 === Nowadays, regardless of the company''s business type, if a company wants to stand out in the globally competitive market, it must choose the suitable vendor to meet the demands of the product. How do companies find vendors that maintain stable supply and cooperate with each other in order to minimize the purchase cost, has become a very important subject. To solve the problem, the most effective way is multi-vendor selection. This paper considers the “Pharmacy Chain Stores” as the research object. The pharmacy chain stores will negotiate the contract with the vendor in order to respond the impact of drastic changes in market demand. The content of the contract is about the minimum commitment or the quantity discount. This paper establishes the integer programming model. When the pharmacy chain stores realize their drug demand, they can choose multiple vendors to determine its procurement strategy and achieve the goal of minimizing purchase costs. Then, this paper used the practical practices of pharmacy chain stores for numerical analysis, comparing the purchase cost with the procurement mode of pharmacy chain stores and the integer programming model of this study to verify which one has the lowest cost. The experimental results found that it could save about 4% of the purchase cost for the pharmacy chain stores when using the integer programming model, and make more profitable for the pharmacy chain stores.
|
|---|
