rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    non sort: A
    title: general class of dynamic lot-sizing models for effective logistics management
  name:
    name part: Jaruphongsa, Wikrom
    name part: 1971-
    role:
      role term: creator
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: xx
    date issued: 2001
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: viii, 131 leaves : illustrations ; 28 cm.
  abstract: 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.
  note: by Wikrom Jaruphongsa.
  note: Vita.
  note: "Major Subject: Industrial Engineering".
  note: Issued also on microfiche from University Microfilm Inc.
  note: Ph. D. Texas A&M University 2001.
  note: Includes bibliographical references (leaves 126-130).
  subject:
    topic: Major industrial engineering
  identifier: 30-33805 UMI
  identifier: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: http://proxy.library.tamu.edu/login
  record info:
    record content source: TXA
    record creation date: 020910
    record change date: 20190325103134.0
    record identifier: in00001701328