一种求解作业车间调度的细胞膜优化算法

A CELL MEMBRANE OPTIMISATION FOR SOLVING SHOP SCHEDULING PROBLEM

在细胞膜优化算法的基础上,对作业车间调度算法进行研究。将细胞膜优化算法用于求解置换流水车间调度问题中的最小化最大完成时间。膜计算是一种仿生物技术的计算模型,它建立在生物细胞的结构基础之上,将优化问题的解看作一个物质,将物质分为三类:脂溶性物质、非脂溶性高浓度物质和非脂溶性低浓度物质,通过搜索区域的不断调整,获取新的最优物质,层层解剖,提取优化模型,将全局优化算法进一步升华。所提算法在不同规模的问题实例上与其他几个具有代表性的算法进行了比较。实验表明,该调度方法具有较好的效果。

The algorithm of job shop scheduling algorithm is studied based on cell membrane optimisation. The cell membrane optimisation （CMO） is employed to solving the minimisation of the makespan in permutation flow shop scheduling problem. Membrane computing is a computational model of imitation biotechnology, which builds its structure on the base of biological cells, while an optimisation problem is equal to a substance. The substance is divided into three types： fat-soluble substances, high concentrations non-fat-soluble substances and low concentrations non-fat-soluble substances. By constantly adjusting the search area, the new optimal substance is obtained. By hierarchical anatomy to extract optimisation model, the global optimisation algorithm is further sublimated. The proposed algorithm is tested on different scale benchmarks and compared with other representative algorithms. Experiment shows that this scheduling method has good effect.