IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v59y2021i22p6898-6918.html
   My bibliography  Save this article

New models and efficient methods for single-product disassembly lot-sizing problem with surplus inventory decisions

Author

Listed:
  • Meisam Pour-Massahian-Tafti
  • Matthieu Godichaud
  • Lionel Amodeo

Abstract

This paper addresses the problem of disassembly lot-sizing for the single-product type. Due to some specific characteristics of disassembly systems, surplus inventory can be generated while satisfying the demand for the components. Disposal decisions are considered here to avoid inventory accumulations throughout the planning horizon. Three new mixed-integer programming (MIP) formulations are proposed to model the problem. The formulations differ from each other concerning the quality of the lower bound provided by their linear relaxation, which is an important issue in MIP resolution methods. Two efficient heuristics are also investigated for real-case applications when MIP algorithms are not relevant. The three formulations and the performance of the heuristics are compared based on new randomly generated instances for disassembly lot-sizing problems. As a managerial insight, the disposal decisions in disassembly lot-sizing models are relevant to save inventory costs.

Suggested Citation

  • Meisam Pour-Massahian-Tafti & Matthieu Godichaud & Lionel Amodeo, 2021. "New models and efficient methods for single-product disassembly lot-sizing problem with surplus inventory decisions," International Journal of Production Research, Taylor & Francis Journals, vol. 59(22), pages 6898-6918, November.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:22:p:6898-6918
    DOI: 10.1080/00207543.2020.1829148
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1829148
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1829148?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.

    Citations

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


    Cited by:

    1. Liang, Wei & Zhang, Zeqiang & Yin, Tao & Zhang, Yu & Wu, Tengfei, 2023. "Modelling and optimisation of energy consumption and profit-oriented multi-parallel partial disassembly line balancing problem," International Journal of Production Economics, Elsevier, vol. 262(C).

    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:taf:tprsxx:v:59:y:2021:i:22:p:6898-6918. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.