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

Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines

Author

Listed:
  • Min-Geun Kim
  • Jae-Min Yu
  • Dong-Ho Lee

Abstract

This study considers a scheduling problem for remanufacturing systems in which end-of-life products are separated into their major components at a disassembly workstation, each of them is reprocessed at its dedicated flow-shop-type reprocessing line with serial workstations, and finally, the reprocessed components, together with new components if required, are reassembled into remanufactured products at a reassembly workstation. Among various system configurations, we focus on the one with parallel flow-shop-type reprocessing lines since it is a typical remanufacturing configuration. The problem is to determine the sequence of products to be disassembled, the sequence of components to be reprocessed at each workstation of flow-shop-type reprocessing lines and the sequence of products to be reassembled for the objective of minimising the total flow time. An integer programming model is developed to represent the problem mathematically, and then, three types of heuristics, i.e. priority rule-based heuristic, Nawaz–Enscore–Ham-based heuristic and iterated greedy algorithm, are proposed due to the problem complexity. To show the performances of the heuristics, a series of computational experiments were done on various test instances, and the results are reported.

Suggested Citation

  • Min-Geun Kim & Jae-Min Yu & Dong-Ho Lee, 2015. "Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines," International Journal of Production Research, Taylor & Francis Journals, vol. 53(6), pages 1819-1831, March.
  • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:6:p:1819-1831
    DOI: 10.1080/00207543.2014.962112
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.962112
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2014.962112?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. Wenjie Wang & Guangdong Tian & Gang Yuan & Duc Truong Pham, 2023. "Energy-time tradeoffs for remanufacturing system scheduling using an invasive weed optimization algorithm," Journal of Intelligent Manufacturing, Springer, vol. 34(3), pages 1065-1083, March.
    2. 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.
    3. Wenkang Zhang & Yufan Zheng & Rafiq Ahmad, 2023. "The integrated process planning and scheduling of flexible job-shop-type remanufacturing systems using improved artificial bee colony algorithm," Journal of Intelligent Manufacturing, Springer, vol. 34(7), pages 2963-2988, October.
    4. Pai Liu & Xi Zhang & Zhongshun Shi & Zewen Huang, 2017. "Simulation Optimization for MRO Systems Operations," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(02), pages 1-23, 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:53:y:2015:i:6:p:1819-1831. 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.