A general class of dynamic lot-sizing models for effective logistics management /
This dissertation presents a general class of dynamic lot-sizing models that arise in the context of recent supply-chain initiatives towards integrated logistics management. The specific problems of interest are applicable in third-party warehousing and vendor-managed inventory practices as well as...
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
2001.
|
| Subjects: | |
| Online Access: | http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=726102911&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD |
| Summary: | This dissertation presents a general class of dynamic lot-sizing models that arise in the context of recent supply-chain initiatives towards integrated logistics management. The specific problems of interest are applicable in third-party warehousing and vendor-managed inventory practices as well as in the context of classical production/distribution system design. The particular extensions studied include modeling multi-mode replenishment opportunities and demand-time window considerations. Models with multi-mode replenishments represent those applications where products can be purchased through various suppliers or delivered using various transportation modes under a supply contract. This class of dynamic lot-sizing problems are challenging due to the cargo capacity constraints that arise in the context of less-than-truckload (LTL) and full-truck-load (FTL) shipments. This dissertation presents several structural optimality properties of multi-mode replenishment problems and develops efficient algorithms based on the dynamic programming approach to find the optimal solution. This dissertation also models the demand time window considerations that arise in the context of contractual supplies. The problem is represented using a two-echelon lot-sizing model with warehouse capacity constraints. This problem is challenging because replenishments at the upper echelon do not necessarily supply demands with consecutive indices. A new decomposition strategy is presented, which leads to a development of polynomial-time algorithms for computing the optimal solution. |
|---|---|
| Item Description: | Vita. "Major Subject: Industrial Engineering". |
| Physical Description: | viii, 131 leaves : illustrations ; 28 cm. Issued also on microfiche from University Microfilm Inc. |
| Bibliography: | Includes bibliographical references (leaves 126-130). |