Competition among companies leads to a race in order to improve the management system of their production with respect to the delivery time. In the last few decades, the optimization of production scheduling has attracted the interest of numerous researchers. This article deals with the Flexible Jobshop Scheduling Problem (FJSP) as one of the most challenging combinatorial optimization problems. FJSP is an extension of the classical jobshop scheduling problem, in which an operation can be processed by several different machines. This article presents a new decomposition based artificial bee colony algorithm for the multi-objective FJSP. The proposed algorithm is tested and compared to other algorithms from the literature on benchmarks of the multi-objective FJSP and its superior performance and robust results have been proved.

公司之间的竞争导致了一场竞赛，以便在交货时间方面改进其生产管理系统。在过去的几十年里，生产调度的优化引起了众多研究人员的兴趣。本文将灵活的作业车间调度问题 (FJSP) 视为最具挑战性的组合优化问题之一。FJSP 是经典作业车间调度问题的扩展，其中一个操作可以由几台不同的机器处理。本文提出了一种新的基于分解的多目标FJSP人工蜂群算法。所提出的算法在多目标 FJSP 基准上与文献中的其他算法进行了测试和比较，并证明了其优越的性能和稳健的结果。