离散回溯搜索算法求解多柔性作业车间调度

针对柔性作业车间生产中机器和工序柔性与多能工的存在建立模型,并提出一种整数编码方案和设一种基于Pareto解集的离散回溯搜索算法进行求解。首先,采用精英化历史种群的方法提升历史种群引导当前种群进化的能力;其次,在交叉变异步骤用遗传交叉算子替代回溯搜索算法原有结构;再次,为保留更多较优解到当前种群,结合快速非支配排序方法更新当前种群;最后,求解数值实例,与多种智能算法进行对比,验证算法的可行性和有效性。

Solving Multi-flexible Job-shop Scheduling Problem by Discrete Backtracking Search Algorithm

Considering multi-skilled workers and the flexibility of machines and operations,a model is built.An integer coding and a discrete backtracking search algorithm based on Pareto set is proposed.Firstly,a method of improving the historical population is proposed to better guide evolution;secondly,at the mutation and crossover stage,the genetic crossover operators are used to replace the origin algorithm structure in the backtracking search algorithm;thirdly,to ensure better solutions to be retained,the current population is refreshed based on fast non-dominated sorting.Finally,effectiveness and feasibility of the algorithm is tested in a calculation example constructed.