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

Service-oriented bi-objective robust collection-disassembly problem with equipment selection

Author

Listed:
  • Xin Liu
  • Feng Chu
  • Alexandre Dolgui
  • Feifeng Zheng
  • Ming Liu

Abstract

The collection-disassembly problem plays an important role in a reverse supply chain. It coordinates the collection and disassembly activities for end-of-life (EOL) products. Most existing works consider the deterministic problems. However, in practice, demands of reusable components in EOL products may be uncertain. Besides, it is usually difficult to exactly obtain probability distributions of uncertain demands, due to inadequate historical data. This paper studies a collection-disassembly problem under partial known distributional information of component demands, in which equipments of the disassembly site, corresponding to different disassembly capacities, have to be selected. The objectives are to minimise the system cost and to maximise the customer service level. For the problem, a novel distributionally robust bi-objective formulation is proposed. Based on the Monte Carlo simulation and an ambiguity set, a sample average approximation (SAA) model and an approximated mixed integer programming (MIP) model are constructed, respectively. Then the two approximated formulations are solved, via the ε-constraint framework, and compared in numerical experiments.

Suggested Citation

  • Xin Liu & Feng Chu & Alexandre Dolgui & Feifeng Zheng & Ming Liu, 2021. "Service-oriented bi-objective robust collection-disassembly problem with equipment selection," International Journal of Production Research, Taylor & Francis Journals, vol. 59(6), pages 1676-1690, March.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:6:p:1676-1690
    DOI: 10.1080/00207543.2020.1723815
    as

    Download full text from publisher

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

    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:6:p:1676-1690. 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.