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

A comparison of piecewise linear programming formulations for stochastic disassembly line balancing

Author

Listed:
  • F. Tevhide Altekin

Abstract

Recently, several mathematical programming formulations and solution approaches have been developed for the stochastic disassembly line balancing problem (DLBP). This paper aims at finding optimal solutions for the stochastic DLBP. Two second-order cone programming (SOCP1 and SOCP2) models and five piecewise linear mixed integer programming (PwLP) models are presented. The PwLP formulations involve two specially ordered sets of type 2 (S1 and S2) models and three convex combination (CC1, CC2 and CC3) models. In each modelling category, the latter models strengthen the initial S1 and CC1 models. Our computational analysis of a total 240 instances of ten problems demonstrates that all the seven models can be used to solve practical-sized DLBP problems to optimality using GUROBI. The SOCP2 model and the strengthened S2 and CC2 models lead to lower computation times, compared to SOCP1, S1, CC1 and CC3, respectively. Using the strengthened S2 and CC2 formulations, the CPU times of the CC3 model available in the literature can be reduced by 50 and 40%, respectively. Besides analysing the optimal solutions and the differences of the computation times, we present insights gained from our results.

Suggested Citation

  • F. Tevhide Altekin, 2017. "A comparison of piecewise linear programming formulations for stochastic disassembly line balancing," International Journal of Production Research, Taylor & Francis Journals, vol. 55(24), pages 7412-7434, December.
    • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:24:p:7412-7434
    DOI: 10.1080/00207543.2017.1351639
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1351639
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2017.1351639?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. Junyong Liang & Shunsheng Guo & Yunfei Zhang & Wenfang Liu & Shengwen Zhou, 2021. "Energy-Efficient Optimization of Two-Sided Disassembly Line Balance Considering Parallel Operation and Uncertain Using Multiobjective Flatworm Algorithm," Sustainability, MDPI, vol. 13(6), pages 1-23, March.
    2. Peng Hu & Feng Chu & Yunfei Fang & Peng Wu, 2022. "Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1423-1446, July.
    3. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).
    4. Junkai He & Feng Chu & Feifeng Zheng & Ming Liu, 2021. "A green-oriented bi-objective disassembly line balancing problem with stochastic task processing times," Annals of Operations Research, Springer, vol. 296(1), pages 71-93, January.
    5. Yicong Gao & Shanhe Lou & Hao Zheng & Jianrong Tan, 2023. "A data-driven method of selective disassembly planning at end-of-life under uncertainty," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 565-585, February.
    6. Lixia Zhu & Zeqiang Zhang & Yi Wang & Ning Cai, 2020. "On the end-of-life state oriented multi-objective disassembly line balancing problem," Journal of Intelligent Manufacturing, Springer, vol. 31(6), pages 1403-1428, August.
    7. Yusha Zhou & Xiuping Guo & Dong Li, 2022. "A dynamic programming approach to a multi-objective disassembly line balancing problem," Annals of Operations Research, Springer, vol. 311(2), pages 921-944, April.

    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:55:y:2017:i:24:p:7412-7434. 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.