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

Citations

WEB OF SCIENCE

43
Citations

SCOPUS

49

초록

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.

키워드

flow-shop-type reprocessing lines; scheduling; remanufacturing systems; heuristics; ITERATED GREEDY ALGORITHM; DRUM-BUFFER-ROPE; ASSEMBLY FLOWSHOP; MAXIMUM LATENESS; PRODUCT RECOVERY; MINIMIZE; MAKESPAN; POLICIES; TIME
제목
Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines
저자
Kim, Min-Geun; Yu, Jae-Min; Lee, Dong-Ho
DOI
10.1080/00207543.2014.962112
발행일
2015-03
유형
Article
저널명
International Journal of Production Research
권
53
호
6
페이지
1819 ~ 1831