碩士 / 國立嘉義大學 / 運輸與物流工程研究所 / 97 / Abstract
In recent years, competition between enterprises has become more furious. Improving the distribution system in a supply chain has become an important duty in order to raise a business’ competitiveness. Over the years, most researches have dealt with this problem by assuming that transportation cost is a linear function of shipping units. This assumption implies that transportation cost is counted on the basis of the number of units load. However, transportation cost cannot only be counted on the basis of the number of units load, but also on the number of full container load(FCL) or full truck load(TL). Thus, transportation cost is counted on the basis of the number of full container load that will become complex and difficult problem.
Under the full container load transportation cost basis, this paper deals with a two-echelon supply chain system with multiple suppliers, a warehouse, and multiple manufacturers. In this system, manufacturers’ demands are satisfied by warehouses receiving their products from suppliers. This paper aims to minimize total shipping costs over a finite time planning period by determining the shipping quantity, inventory quantity and delay quantity of each product on the distribution channels, from suppliers to warehouse, and from warehouse to manufacturers. The mathematical model established in this research is a mix integer programming model. The well-known commercial software, LINGO 10.0, was used to solve the problems. Computational results show that all of the examples can be solved within a reasonable amount of time. In addition, sensitivity analysis was also conducted to illustrate the impact of variation within the parameters on the computational results.
Identifer | oai:union.ndltd.org:TW/097NCYU5425010 |
Date | January 2009 |
Creators | Chen Yi-Jing, 陳怡靜 |
Contributors | You Peng-Sheng, 游鵬勝 |
Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
Language | zh-TW |
Detected Language | English |
Type | 學位論文 ; thesis |
Format | 94 |
Page generated in 0.0386 seconds