Recently, meta-heuristics have been employed and improved for solving various scheduling and combinational optimization problems. Disassembly line balancing, planning and scheduling problems (DLBPSP) are typical examples since the high complexity (NP-Hard). Since 2000s, numerous articles have represented the applications of meta-heuristics for solving DLBPSP. This paper aims to review the state-of-the-art of this topic. It can help researchers, especially for new researchers, to identify the current status of meta-heuristics for solving DLBPSP, to obtain the technologies used in various algorithms, and to follow the research trends of this topic. First, the related research articles are summarized, classified, and analyzed. Second, the special meta-heuristics for solving DLBPSP are reviewed. The encoding/decoding rules and improvement strategies are analyzed and discussed. Finally, the current research trends are summarized, and some future research directions are given.

近来，已采用元启发式方法并对其进行了改进，以解决各种调度和组合优化问题。拆装线平衡，计划和调度问题（DLBPSP）是典型示例，因为其复杂性很高（NP-Hard）。自2000年代以来，许多文章代表了元启发法在解决DLBPSP中的应用。本文旨在回顾该主题的最新技术。它可以帮助研究人员，特别是对于新研究人员，确定用于求解DLBPSP的元启发式方法的当前状态，获得各种算法中使用的技术，并跟踪该主题的研究趋势。首先，对相关研究文章进行了归纳，分类和分析。其次，回顾了解决DLBPSP的特殊元启发式方法。分析和讨论了编码/解码规则和改进策略。最后，总结了当前的研究趋势，并给出了今后的研究方向。