IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v63y2016i8p647-666.html
   My bibliography  Save this article

On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

Author

Listed:
  • Ayşe N. Arslan
  • Jean‐Philippe P. Richard
  • Yongpei Guan

Abstract

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017

Suggested Citation

  • Ayşe N. Arslan & Jean‐Philippe P. Richard & Yongpei Guan, 2016. "On the polyhedral structure of two‐level lot‐sizing problems with supplier selection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 647-666, December.
    • Handle: RePEc:wly:navres:v:63:y:2016:i:8:p:647-666
    DOI: 10.1002/nav.21725
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21725
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21725?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
    ---><---

    References listed on IDEAS

    as
    1. POCHET, Yves & WOLSEY, Laurence A., 1988. "Lot-size models with backlogging: strong reformulations and cutting planes," LIDAM Reprints CORE 791, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Francesco Gaglioppa & Lisa A. Miller & Saif Benjaafar, 2008. "Multitask and Multistage Production Planning and Scheduling for Process Industries," Operations Research, INFORMS, vol. 56(4), pages 1010-1025, August.
    3. Sila Çetinkaya & Chung-Yee Lee, 2000. "Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems," Management Science, INFORMS, vol. 46(2), pages 217-232, February.
    4. POCHET, Yves & WOLSEY, Laurence A., 1993. "Lot-sizing with constant batches: formulation and valid inequalities," LIDAM Reprints CORE 1066, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Anantaram Balakrishnan & Joseph Geunes, 2000. "Requirements Planning with Substitutions: Exploiting Bill-of-Materials Flexibility in Production Planning," Manufacturing & Service Operations Management, INFORMS, vol. 2(2), pages 166-185, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Jing, Fuying & Chao, Xiangrui, 2022. "Forecast horizons for a two-echelon dynamic lot-sizing problem," Omega, Elsevier, vol. 110(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Minjiao Zhang & Simge Küçükyavuz & Hande Yaman, 2012. "A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands," Operations Research, INFORMS, vol. 60(4), pages 918-935, August.
    2. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    3. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    4. Hark-Chin Hwang, 2009. "Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy," Transportation Science, INFORMS, vol. 43(2), pages 244-264, May.
    5. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    6. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    7. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.
    8. Alper Atamtürk & Simge Küçükyavuz, 2005. "Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation," Operations Research, INFORMS, vol. 53(4), pages 711-730, August.
    9. 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.
    10. Absi, Nabil & Kedad-Sidhoum, Safia, 2008. "The multi-item capacitated lot-sizing problem with setup times and shortage costs," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1351-1374, March.
    11. VAN VYVE, Mathieu & WOLSEY, Laurence & YAMAN, Hande, 2012. "Relaxations for two-level multi-item lot-sizing problem," LIDAM Discussion Papers CORE 2012031, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Chen, Jing & Dong, Ming & Xu, Lei, 2018. "A perishable product shipment consolidation model considering freshness-keeping effort," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 56-86.
    13. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    14. Alarcón, F. & Alemany, M.M.E. & Ortiz, A., 2009. "Conceptual framework for the characterization of the order promising process in a collaborative selling network context," International Journal of Production Economics, Elsevier, vol. 120(1), pages 100-114, July.
    15. Archibald, Thomas W. & Bokkers, Menno B. & Dekker, Rommert & Vliet, Andre van, 1999. "Minimising bins in transmission systems," European Journal of Operational Research, Elsevier, vol. 115(2), pages 380-391, June.
    16. Mutlu, Fatih & Çetinkaya, Sıla, 2020. "Supplier–carrier–buyer channels: Contractual pricing for a carrier serving a supplier–buyer partnership," International Journal of Production Economics, Elsevier, vol. 230(C).
    17. Zhili Zhou & Yongpei Guan, 2013. "Two-stage stochastic lot-sizing problem under cost uncertainty," Annals of Operations Research, Springer, vol. 209(1), pages 207-230, October.
    18. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    19. Lang, Jan Christian & Shen, Zuo-Jun Max, 2011. "Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions," European Journal of Operational Research, Elsevier, vol. 214(3), pages 595-605, November.
    20. Yu, Yimin & Shou, Biying & Ni, Yaodong & Chen, Li, 2017. "Optimal production, pricing, and substitution policies in continuous review production-inventory systems," European Journal of Operational Research, Elsevier, vol. 260(2), pages 631-649.

    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:wly:navres:v:63:y:2016:i:8:p:647-666. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.