IAD Index of Academic Documents
  • Home Page
  • About
    • About Izmir Academy Association
    • About IAD Index
    • IAD Team
    • IAD Logos and Links
    • Policies
    • Contact
  • Submit A Journal
  • Submit A Conference
  • Submit Paper/Book
    • Submit a Preprint
    • Submit a Book
  • Contact
  • Hacettepe Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi
  • Volume:13
  • A LAGRANGEAN RELAXATION APPROACH FOR MULTI PRODUCT, MULTI ECHELON SYSTEMS WITH CAPACITATED DYNAMIC L...

A LAGRANGEAN RELAXATION APPROACH FOR MULTI PRODUCT, MULTI ECHELON SYSTEMS WITH CAPACITATED DYNAMIC LOTSIZING

Authors : Ş Armağan TARIM, João Paulo DEBARROS
Pages : 117-133
View : 17 | Download : 10
Publication Date : 1995-12-31
Article Type : Research Paper
Abstract :This paper focuses on multi-echelon inventory systems having an arborescent structure. In the structure each intermediate facility has exactly one predecessor and possibly several successors. All inventory costs are assumed linear- with ordering cost that is independent of the order quantity for each stocking point. The model takes account of dynamic cost structure and dynamic demand pattern as well as capacity limitations. The paper exploits a mixed bivalent programming model to determine what inventory levels, if anv, should be maintained at the various stocking paints in order to minimise total inventory cost of the entire system. A computationally efficient Lagrangean relaxation-based procedure is developed to decompose the model into submodels by each stocking point and product.
Keywords : Inventory, Integer Programming, Modelling, Production

ORIGINAL ARTICLE URL
VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.


Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2025