IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v226y2013i2p237-245.html
   My bibliography  Save this article

Exact solution approaches for bilevel lot-sizing

Author

Listed:
  • Kis, Tamás
  • Kovács, András

Abstract

In this paper we propose exact solution methods for a bilevel uncapacitated lot-sizing problem with backlogs. This is an extension of the classical uncapacitated lot-sizing problem with backlogs, in which two autonomous and self-interested decision makers constitute a two-echelon supply chain. The leader buys items from the follower in order to meet external demand at lowest cost. The follower also tries to minimize its costs. Both parties may backlog. We study the leader’s problem, i.e., how to determine supply requests over time to minimize its costs in view of the possible actions of the follower. We develop two mixed-integer linear programming reformulations, as well as cutting planes to cut off feasible, but suboptimal solutions. We compare the reformulations on a series of benchmark instances.

Suggested Citation

  • Kis, Tamás & Kovács, András, 2013. "Exact solution approaches for bilevel lot-sizing," European Journal of Operational Research, Elsevier, vol. 226(2), pages 237-245.
    • Handle: RePEc:eee:ejores:v:226:y:2013:i:2:p:237-245
    DOI: 10.1016/j.ejor.2012.11.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712008715
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.11.023?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bard, Jonathan F, 1983. "Coordination of a multidivisional organization through two levels of management," Omega, Elsevier, vol. 11(5), pages 457-468.
    2. Lukac, Zrinka & Soric, Kristina & Rosenzweig, Visnja Vojvodic, 2008. "Production planning problem with sequence dependent setups as a bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1504-1512, June.
    3. 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).
    4. POCHET, Yves & WOLSEY, Laurence A., 2010. "Single item lot-sizing with non-decreasing capacities," LIDAM Reprints CORE 2145, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Hau Lee & Seungjin Whang, 1999. "Decentralized Multi-Echelon Supply Chains: Incentives and Information," Management Science, INFORMS, vol. 45(5), pages 633-640, May.
    6. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    7. Gaetan Belvaux & Laurence A. Wolsey, 2001. "Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs," Management Science, INFORMS, vol. 47(7), pages 993-1007, July.
    8. Patrice Marcotte & Gilles Savard, 2005. "Bilevel Programming: A Combinatorial Perspective," Springer Books, in: David Avis & Alain Hertz & Odile Marcotte (ed.), Graph Theory and Combinatorial Optimization, chapter 0, pages 191-217, Springer.
    9. Willard I. Zangwill, 1969. "A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System--A Network Approach," Management Science, INFORMS, vol. 15(9), pages 506-527, May.
    10. BARANY, Imre & VAN ROY, Tony J. & WOLSEY, Laurence A., 1984. "Strong formulations for multi-item capacitated lot sizing," LIDAM Reprints CORE 590, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Li, Xiuhui & Wang, Qinan, 2007. "Coordination mechanisms of supply chain systems," European Journal of Operational Research, Elsevier, vol. 179(1), pages 1-16, May.
    12. VAN VYVE, Mathieu, 2006. "Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity," LIDAM Reprints CORE 1855, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. BELVAUX, Gaetan & WOLSEY, Laurence A., 2001. "Modelling practical lot-sizing problems as mixed-integer programs," LIDAM Reprints CORE 1516, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. BARANY, Imre & VAN ROY, Tony & WOLSEY, Laurence A., 1984. "Uncapacitated lot-sizing: the convex hull of solutions," LIDAM Reprints CORE 605, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    15. Martin Albrecht, 2010. "Supply Chain Coordination Mechanisms," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-642-02833-5, October.
    16. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    17. MELO, Rafael A. & WOLSEY, Laurence A., 2010. "Uncapacitated two-level lot-sizing," LIDAM Reprints CORE 2235, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    18. Imre Barany & Tony J. Van Roy & Laurence A. Wolsey, 1984. "Strong Formulations for Multi-Item Capacitated Lot Sizing," Management Science, INFORMS, vol. 30(10), pages 1255-1261, October.
    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. Kailash Lachhwani, 2021. "Solving the general fully neutrosophic multi-level multiobjective linear programming problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(4), pages 1192-1216, December.
    2. Egri, Péter & Kis, Tamás & Kovács, András & Váncza, József, 2014. "An inverse economic lot-sizing approach to eliciting supplier cost parameters," International Journal of Production Economics, Elsevier, vol. 149(C), pages 80-88.
    3. Rowshannahad, Mehdi & Absi, Nabil & Dauzère-Pérès, Stéphane & Cassini, Bernard, 2018. "Multi-item bi-level supply chain planning with multiple remanufacturing of reusable by-products," International Journal of Production Economics, Elsevier, vol. 198(C), pages 25-37.
    4. Milička, P. & Šůcha, P. & Vanhoucke, M. & Maenhout, B., 2022. "The bilevel optimisation of a multi-agent project scheduling and staffing problem," European Journal of Operational Research, Elsevier, vol. 296(1), pages 72-86.

    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. 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.
    2. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    3. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    4. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    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. Egri, Péter & Kis, Tamás & Kovács, András & Váncza, József, 2014. "An inverse economic lot-sizing approach to eliciting supplier cost parameters," International Journal of Production Economics, Elsevier, vol. 149(C), pages 80-88.
    7. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    8. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    9. Andrea Raiconi & Julia Pahl & Monica Gentili & Stefan Voß & Raffaele Cerulli, 2017. "Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-24, October.
    10. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    11. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.
    12. Wolsey, Laurence A., 1995. "Progress with single-item lot-sizing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 395-401, November.
    13. 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.
    14. Zeger Degraeve & Raf Jans, 2007. "A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times," Operations Research, INFORMS, vol. 55(5), pages 909-920, October.
    15. 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.
    16. Eksioglu, Sandra Duni, 2009. "A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment," European Journal of Operational Research, Elsevier, vol. 197(1), pages 93-101, August.
    17. 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.
    18. 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).
    19. Kaczmarczyk, Waldemar, 2020. "Valid inequalities for proportional lot-sizing and scheduling problem with fictitious microperiods," International Journal of Production Economics, Elsevier, vol. 219(C), pages 236-247.
    20. Siao-Leu Phouratsamay & Safia Kedad-Sidhoum & Fanny Pascual, 2021. "Coordination of a two-level supply chain with contracts," 4OR, Springer, vol. 19(2), pages 235-264, June.

    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:eee:ejores:v:226:y:2013:i:2:p:237-245. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.