Full metadata record
|dc.contributor||Department of Applied Mathematics||en_US|
|dc.publisher||Hong Kong Polytechnic University||-|
|dc.rights||All rights reserved||en_US|
|dc.title||Select the best algorithm of joint replenishment inventory control for DSL||en_US|
|dcterms.abstract||In this project, we consider inventory control models where a number of items are replenished jointly. We study joint replenishment inventory models under deterministic and stochastic demand conditions. For the deterministic joint replenishment inventory system, the total cost function includes fixed cost of a replenishment, item dependent replenishment cost and inventory carrying cost for individual items. For the stochastic joint replenishment inventory system, we study the coordinated control policy with control parameters (S, c, s) in zero lead time. The total cost per month and percentage saving are used to compare the results between the different algorithms, and the ultimate aim is to find the best algorithm for DSL. In real life situation, joint replenishment inventory models are highly applicated compared with single item replenishment models. One very important factor which makes the co-ordination of replenishments cost effective is the joint set-up cost structure. Inventory systems with this cost structure have received considerable attention in the management science and production operations management literature in the past two decades.||en_US|
|dcterms.extent||xi, 84 leaves : ill. ; 31 cm||en_US|
|dcterms.LCSH||Inventory control -- Mathematical models||en_US|
|dcterms.LCSH||Hong Kong Polytechnic University -- Dissertations||en_US|
Files in This Item:
|b14390802.pdf||For All Users (off-campus access for PolyU Staff & Students only)||2.12 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: