4.7 Article

A new environment-aware scheduling method for remanufacturing system with non-dedicated reprocessing lines using improved flower pollination algorithm

Journal

JOURNAL OF MANUFACTURING SYSTEMS
Volume 57, Issue -, Pages 94-108

Publisher

ELSEVIER SCI LTD
DOI: 10.1016/j.jmsy.2020.08.006

Keywords

Remanufacturing system; Remanufacturing scheduling; Environmental protection; Carbon emission; Non-dedicated reprocessing lines; Flower pollination algorithm

Funding

  1. National Natural Science Foundation of China [51875503, 51975512, 51775496]
  2. Zhejiang Natural Science Foundation of China [LZ20E050001]

Ask authors/readers for more resources

As the resource crisis and environmental pollution become increasingly prominent, remanufacturing is currently a popular research field for addressing these issues. However, scheduling for remanufacturing is more difficult than that for traditional manufacturing because the entire remanufacturing system (RMS) involves three cooperative subsystems: disassembly, reprocessing, and reassembly. Few studies have focused on the scheduling of the entire RMS and addressed the quality differences of defective components using non-dedicated reprocessing lines. Thus, this paper proposes a new environment-aware scheduling model for RMS, which considers not only three subsystems simultaneously, but also the non-dedicated reprocessing lines related to the recycled quality of defective components. The proposed model also integrates environmental factors by considering the carbon emissions of machines to take advantage of the environmental benefits in remanufacturing. To solve the proposed model, an improved flower pollination algorithm with new two-dimensional representation scheme is employed, which not only utilizes the self-adaptive parameter but also integrates path relinking technique, local search strategy, and elite replacement strategy. Experiments are performed to illustrate the effectiveness of the proposed algorithm for solving the remanufacturing scheduling problem by comparing it with six baseline algorithms.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available