IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v55y2004i3d10.1057_palgrave.jors.2601690.html
   My bibliography  Save this article

A two-stage heuristic for disassembly scheduling with assembly product structure

Author

Listed:
  • D-H Lee

    (Hanyang University)

  • P Xirouchakis

    (Swiss Federal Institute of Technology (EPFL))

Abstract

Disassembly scheduling, one of the important operational problems in disassembly systems, is the problem of determining the ordering and disassembly schedules of used or end-of-life products while satisfying the demand of their parts or components over a certain planning horizon. This paper considers products with assembly structure for the objective of minimizing the sum of purchase, set up, inventory holding, and disassembly operation costs, and suggests a two-stage heuristic, in which an initial solution is obtained in the form of the minimal latest ordering and disassembly schedule, and then improved iteratively considering trade-offs among different cost factors. To show the performance of the heuristic, computational experiments were done on the example obtained from the literature and a number of randomly generated test problems, and the results show that the heuristic can give optimal or very near-optimal solutions within very short computation times.

Suggested Citation

  • D-H Lee & P Xirouchakis, 2004. "A two-stage heuristic for disassembly scheduling with assembly product structure," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 287-297, March.
    • Handle: RePEc:pal:jorsoc:v:55:y:2004:i:3:d:10.1057_palgrave.jors.2601690
    DOI: 10.1057/palgrave.jors.2601690
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601690
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601690?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. Harish C. Bahl & Larry P. Ritzman & Jatinder N. D. Gupta, 1987. "OR Practice—Determining Lot Sizes and Resource Requirements: A Review," Operations Research, INFORMS, vol. 35(3), pages 329-345, June.
    2. Kumar, Narendra & Vrat, Prem & Sushil, 1994. "A simulation study of unit exchange spares management of diesel locomotives in the Indian railways," International Journal of Production Economics, Elsevier, vol. 33(1-3), pages 225-236, January.
    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. Yaping Ren & Xinyu Lu & Hongfei Guo & Zhaokang Xie & Haoyang Zhang & Chaoyong Zhang, 2023. "A Review of Combinatorial Optimization Problems in Reverse Logistics and Remanufacturing for End-of-Life Products," Mathematics, MDPI, vol. 11(2), pages 1-24, January.
    2. Suzanne, Elodie & Absi, Nabil & Borodin, Valeria, 2020. "Towards circular economy in production planning: Challenges and opportunities," European Journal of Operational Research, Elsevier, vol. 287(1), pages 168-190.
    3. Barba-Gutierrez, Y. & Adenso-Diaz, B. & Gupta, S.M., 2008. "Lot sizing in reverse MRP for scheduling disassembly," International Journal of Production Economics, Elsevier, vol. 111(2), pages 741-751, February.
    4. Mehmet Talha Dulman & Surendra M. Gupta, 2018. "Evaluation of Maintenance and EOL Operation Performance of Sensor-Embedded Laptops," Logistics, MDPI, vol. 2(1), pages 1-22, January.
    5. H-J Kim & D-H Lee & P Xirouchakis, 2006. "A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1231-1240, October.
    6. Slama, Ilhem & Ben-Ammar, Oussama & Thevenin, Simon & Dolgui, Alexandre & Masmoudi, Faouzi, 2022. "Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1183-1198.
    7. Tian, Xiaoyu & Zhang, Zhi-Hai, 2019. "Capacitated disassembly scheduling and pricing of returned products with price-dependent yield," Omega, Elsevier, vol. 84(C), pages 160-174.
    8. Lu, Liang & Qi, Xiangtong & Liu, Zhixin, 2014. "On the cooperation of recycling operations," European Journal of Operational Research, Elsevier, vol. 233(2), pages 349-358.
    9. H-J Kim & D-H Lee & P Xirouchakis & O K Kwon, 2009. "A branch and bound algorithm for disassembly scheduling with assembly product structure," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(3), pages 419-430, March.

    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. Cannella, Salvatore & Bruccoleri, Manfredi & Framinan, Jose M., 2016. "Closed-loop supply chains: What reverse logistics factors influence performance?," International Journal of Production Economics, Elsevier, vol. 175(C), pages 35-49.
    2. A. Kimms, 1997. "Demand shuffle—A method for multilevel proportional lot sizing and scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(4), pages 319-340, June.
    3. Guide, V. Daniel R. & Srivastava, Rajesh, 1997. "Repairable inventory theory: Models and applications," European Journal of Operational Research, Elsevier, vol. 102(1), pages 1-20, October.
    4. Guide, V. Daniel R. & Kraus, Mark E. & Srivastava, Rajesh, 1997. "Scheduling policies for remanufacturing," International Journal of Production Economics, Elsevier, vol. 48(2), pages 187-204, January.
    5. 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.
    6. Wu, Xiang & (Yale) Gong, Yeming & Xu, Haoxuan & Chu, Chengbin & Zhang, Jinlong, 2017. "Dynamic lot-sizing models with pricing for new products," European Journal of Operational Research, Elsevier, vol. 260(1), pages 81-92.
    7. Drexl, Andreas & Kimms, Alf, 1996. "Lot sizing and scheduling: Survey and extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 421, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Drexl, Andreas & Fleischmann, B. & Günther, H.-O. & Stadtler, H. & Tempelmeier, H., 1993. "Konzeptionelle Grundlagen kapazitätsorientierter PPS-Systeme," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 315, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Daniel Quadt & Heinrich Kuhn, 2009. "Capacitated lot‐sizing and scheduling with parallel machines, back‐orders, and setup carry‐over," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(4), pages 366-384, June.
    10. Fabrizio Marinelli & Maria Nenni & Antonio Sforza, 2007. "Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company," Annals of Operations Research, Springer, vol. 150(1), pages 177-192, March.
    11. Sônia Poltroniere & Kelly Poldi & Franklina Toledo & Marcos Arenales, 2008. "A coupling cutting stock-lot sizing problem in the paper industry," Annals of Operations Research, Springer, vol. 157(1), pages 91-104, January.
    12. Alf Kimms, 1998. "Ablauforganisation bei Serienproduktion in Fließfertigungssystemen," Schmalenbach Journal of Business Research, Springer, vol. 50(7), pages 641-655, July.
    13. Prashant Premkumar & P. N. Ram Kumar, 2019. "Literature Review of Locomotive Assignment Problem from Service Operations Perspective: The Case of Indian Railways," IIM Kozhikode Society & Management Review, , vol. 8(1), pages 74-86, January.
    14. S. Selcuk Erenguc & H. Murat Mercan, 1990. "A multifamily dynamic lot‐sizing model with coordinated replenishments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 539-558, August.
    15. Drexl, Andreas & Haase, Knut, 1992. "A new type of model for multi-item capacitated dynamic lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 286, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Hu, Qiwei & Boylan, John E. & Chen, Huijing & Labib, Ashraf, 2018. "OR in spare parts management: A review," European Journal of Operational Research, Elsevier, vol. 266(2), pages 395-414.
    17. Daniel, V. & Guide, R. Jr., 1997. "Scheduling with priority dispatching rules and drum-buffer-rope in a recoverable manufacturing system," International Journal of Production Economics, Elsevier, vol. 53(1), pages 101-116, November.

    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:pal:jorsoc:v:55:y:2004:i:3:d:10.1057_palgrave.jors.2601690. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.