【摘要】 针对柔性作业车间调度问题计算复杂度高，求解困难的难题，提出了一种离散多元宇宙优化算法。首先，建立起以最大完工时间为目标的柔性作业车间调度模型，使用两段式整数编码和贪婪插入解码建立算法与调度问题之间的联系；其次，设计宇宙种群初始化方法，以确保初始调度解的质量和多样性；然后，在基本多元宇宙算法的基础上，设计新的白洞选择，黑洞白洞传输和向最优宇宙移动机制，提高了算法求解柔性作业车间调度问题的性能。通过基准算例与其他智能算法比较，实验表明，所提算法可以有效的求解柔性作业车间调度问题。更多还原

【Abstract】 In order to solve the flexible job-shop scheduling problem with high computational complexity, a discrete multiverse optimization algorithm is proposed.Firstly, a flexible job-shop scheduling model with the goal of maximum completion time is established, and the connection between the algorithm and the scheduling problem is established using two segment integer coding and greedy insertion decoding; Secondly, the initialization method of the universe population is designed to ensure the quality and diversity of the initial scheduling solution; Then, based on the basic multiverse algorithm, a new white hole selection, black hole white hole transmission and moving to the optimal universe mechanism are designed to improve the performance of the algorithm in solving the flexible job-shop scheduling problem.The benchmark example is compared with other intelligent algorithms, and the experimental results show that the proposed algorithm can effectively solve the flexible job-shop scheduling problem.更多还原