Production scheduling is one of the most critical issues in manufacturing and production systems and has markedly positive impact on the performances of manufacturing. In the past decades, various scheduling problems have been extensively solved by multi-population meta-heuristics, which are artificial bee colony (ABC), imperialist competitive algorithm (ICA) and shuffled frog-leaping algorithm (SFLA); however, the related works of multi-population meta-heuristics to scheduling are hardly reviewed. In this paper, we provide an extensive recall on solving production scheduling based on ABC, ICA or SFLA. A new classification on scheduling problems is first given, then three algorithms are described and their applications to scheduling are summarized in a systematic way; finally, the main conclusions are drawn and some future research directions are presented.

生产计划是制造和生产系统中最关键的问题之一，对制造性能产生明显的积极影响。在过去的几十年中，通过人工蜂群（ABC），帝国主义竞争算法（ICA）和洗牌蛙跳算法（SFLA）的多种群元启发式方法已广泛解决了各种调度问题。但是，关于多人口元启发式方法与调度的相关工作几乎未得到评论。在本文中，我们对基于ABC，ICA或SFLA的生产计划求解提供了广泛的回忆。首先给出了调度问题的新分类，然后描述了三种算法，并系统地总结了它们在调度中的应用。最后，