.png){kind=icon}
.png){kind=icon}
Return
Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2014.962112.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
flow-shop-type reprocessing lines
scheduling
remanufacturing systems
heuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W