IDEAS home Printed from https://ideas.repec.org/p/lms/mansci/mrg-0006.html

Competition under Dynamic Lot Sizing Costs with Capacity Acquisition

Author

Listed:
  • Hongyan Li

    (Aarhus School of Business, Aarhus University, Denmark)

  • Joern Meissner

    (Department of Management Science, Lancaster University Management School)

Abstract

Lot-sizing and capacity planning are important supply chain decisions, and competition and cooperation affect the performance of these decisions. In this paper, we look into the dynamic lot sizing and resource competition problem of an industry consisting of multiple firms. A capacity competition model combining the complexity of time-varying demand with cost functions and economies os scale arising from dynamic lot-sizing costs is developed. Each firm can replenish inventory at the beginning of each period in a finite planning horizon. Fixed as well as variable production costs incur for each production setup, along with inventory carrying costs. The individual production lots of each firm are limited by a constant capacity restriction, which is purchased up front for the planning horizon. The capacity can be purchased from a spot market, and the capacity acquisition cost fluctuates with the total capacity demand of all the competing firms. We solve the competition model and establish the existence of a capacity equilibrium over the firms and the associated optimal dynamic lot-sizing plan for each firm under mild conditions.

Suggested Citation

  • Hongyan Li & Joern Meissner, 2006. "Competition under Dynamic Lot Sizing Costs with Capacity Acquisition," Working Papers MRG/0006, Department of Management Science, Lancaster University, revised Apr 2010.
  • Handle: RePEc:lms:mansci:mrg-0006
    as

    Download full text from publisher

    File URL: http://www.meiss.com/en/publications/capacity-competition-lot-sizing.html
    File Function: Webpage
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

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


    Cited by:

    1. Suliman, Saad M.A. & Jawad, Sayed Husain, 2012. "Optimization of preventive maintenance schedule and production lot size," International Journal of Production Economics, Elsevier, vol. 137(1), pages 19-28.
    2. Claudio Telha & Margarida Carvalho, 2025. "Integration of Sales and Operations: A Dynamic Mixed-Integer Programming Game," Dynamic Games and Applications, Springer, vol. 15(1), pages 306-328, March.
    3. Hongyan Li & Joern Meissner, 2018. "Capacity optimization and competition with cyclical and lead-time-dependent demands," Annals of Operations Research, Springer, vol. 271(2), pages 737-763, December.
    4. Luis A. Guardiola & Ana Meca & Justo Puerto, 2021. "Unitary Owen Points in Cooperative Lot-Sizing Models with Backlogging," Mathematics, MDPI, vol. 9(8), pages 1-19, April.
    5. Carvalho, Margarida & Pedroso, João Pedro & Telha, Claudio & Van Vyve, Mathieu, 2018. "Competitive uncapacitated lot-sizing game," International Journal of Production Economics, Elsevier, vol. 204(C), pages 148-159.
    6. Stuart Harwood & Francisco Trespalacios & Dimitri Papageorgiou & Kevin Furman, 2024. "Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming," Computational Optimization and Applications, Springer, vol. 87(2), pages 641-676, March.
    7. Ou, Jinwen & Feng, Jiejian, 2019. "Production lot-sizing with dynamic capacity adjustment," European Journal of Operational Research, Elsevier, vol. 272(1), pages 261-269.
    8. Carvalho, Margarida & Lodi, Andrea & Pedroso, João.P., 2022. "Computing equilibria for integer programming games," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1057-1070.
    9. Rapine, Christophe & Penz, Bernard & Gicquel, Céline & Akbalik, Ayse, 2018. "Capacity acquisition for the single-item lot sizing problem under energy constraints," Omega, Elsevier, vol. 81(C), pages 112-122.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:lms:mansci:mrg-0006. 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: Joern Meissner The email address of this maintainer does not seem to be valid anymore. Please ask Joern Meissner to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/degraus.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.