Biobjective Parallel Disassembly Line Balancing: A Problem Considering Government Benefit Workers

Abstract

Extensive research on the disassembly line balancing problem (DLBP) has helped remanufacturing and enhanced the reuse of discarded products. This article addresses the multiproduct biobjective parallel DLBP (PDLBP) and incorporates the hiring of workers with government benefits (WGBs). A mixed-integer linear programming (MILP) model is formulated to precisely represent the problem and all constraints associated with its solution, where the goal is to optimize disassembly profit and WGB utilization. A multiobjective salp swarm algorithm (SSA) is constructed to search for optimal solutions quickly. A three-stage encoding and decoding procedure is designed to improve the search process. Different types of instances are combined for feasibility testing. To confirm the advantage of the proposed algorithm, four peer algorithms are employed for comparison. The results confirm the validity of the model and the outstanding performance of the newly proposed algorithm.