Abstract
As the energy shortage and environment pollution become increasingly deteriorating, remanufacturing has become a hot research field for its energy-saving and environmental advantages. In remanufacturing systems, scheduling is a key step that directly affects the successful realization of remanufacturing benefits. Since the remanufacturing involves many two-fold uncertainties, scheduling for remanufacturing is more challenging than for traditional manufacturing. However, few studies have addressed these two-fold uncertainties in remanufacturing environments. Thus, this study proposes a new bifuzzy remanufacturing scheduling model, which handles many two-fold uncertainties in remanufacturing and applies the bifuzzy variable to describe these uncertainties. Multiple non-identical parallel processing lines for remanufacturing end-of-life products have also been integrated into the proposed model. An extended discrete particle swarm optimization algorithm with an effective representation scheme is proposed to solve the model. In the presented algorithm, three new guiding directions and a new multi-directional guiding strategy are designed to enhance the diversity of population, and a new position updating mechanism, local search strategy, and anti-stagnation mechanism are integrated to improve the algorithmic performance. Experiments are performed to verify the effectiveness of the proposed model by comparing it with the traditional deterministic model, and the effectiveness of the proposed algorithm in solving this model by comparing it with other baseline algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.