IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v14y1966i3p486-507.html
   My bibliography  Save this article

A Deterministic Multiproduct, Multi-Facility Production and Inventory Model

Author

Listed:
  • Willard I. Zangwill

    (University of California, Berkeley, California)

Abstract

A deterministic multiproduct, multifacility, multiperiod production planning model is analyzed. The model considers concave production costs, which can depend upon the production in several different facilities, and piecewise concave inventory costs. Backlogging of unsatisfied demand is permitted. After determining the general form of the minimum cost production schedule, algorithms to calculate the minimum cost schedule explicitly in certain specific cases are presented.

Suggested Citation

  • Willard I. Zangwill, 1966. "A Deterministic Multiproduct, Multi-Facility Production and Inventory Model," Operations Research, INFORMS, vol. 14(3), pages 486-507, June.
    • Handle: RePEc:inm:oropre:v:14:y:1966:i:3:p:486-507
    DOI: 10.1287/opre.14.3.486
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.14.3.486
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.14.3.486?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Danny Segev, 2014. "An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 432-444, May.
    2. Vladimir Krasik & Joseph Leung & Michael Pinedo & Jiawei Zhang, 2008. "Scheduling multiple products on parallel machines with setup costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 654-669, October.
    3. Chia‐Shin Chung & Sin‐Hoon Hum & Omer Kirca, 2000. "An optimal procedure for the coordinated replenishment dynamic lot‐sizing problem with quantity discounts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(8), pages 686-695, December.
    4. Retsef Levi & Robin O. Roundy & David B. Shmoys, 2006. "Primal-Dual Algorithms for Deterministic Inventory Problems," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 267-284, May.
    5. Pfeiffer, Thomas, 1999. "Transfer pricing and decentralized dynamic lot-sizing in multistage, multiproduct production processes," European Journal of Operational Research, Elsevier, vol. 116(2), pages 319-330, July.
    6. Jörg Homberger, 2008. "A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 124-132, February.
    7. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    8. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:14:y:1966:i:3:p:486-507. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.