A note on integrated disassembly line balancing and routing problem
Jianguang Feng and
Ada Che
International Journal of Production Research, 2023, vol. 61, issue 9, 3144-3150
Abstract:
This note comments on the study of [Diri Kenger, Zülal, Çağrı Koç, and Eren Özceylan. 2020. “Integrated Disassembly Line Balancing and Routing Problem.” International Journal of Production Research 58 (23): 7250–7268.] which studies an integrated disassembly line balancing and routing problem and develops two mixed integer linear programming (MILP) models and three mixed integer nonlinear programming (MINLP) models to handle five different scenarios, respectively. The purpose is twofold. First, we demonstrate that the two MILP models can be separated into two parallel subproblems whose optimal solutions can be combined to obtain the optimal solution of the original models. Second, we show that the three MINLP models can be linearised and propose two different linearisation techniques to reformulate them as equivalent MILP models. Computational results indicate that the linearised model outperforms the original nonlinear model in most cases.
Date: 2023
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2022.2070881 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:61:y:2023:i:9:p:3144-3150
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20
DOI: 10.1080/00207543.2022.2070881
Access Statistics for this article
International Journal of Production Research is currently edited by Professor A. Dolgui
More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().