论文部分内容阅读
多目标柔性车间调度问题一直是一个学术的难题,关于并行机的问题更是很少讨论。建立了基于并行机的多目标柔性车间调度的数学模型,目标函数为最小化最大完工时间和加工成本。与以往智能优化算法不一样的是,提出了一种基于pareto的简单优化算法。该算法主要包括两个模块:加工顺序模块和机器选择模块,其中机器选择模块采用了基于pareto优化算法。最后,数字实验表明了该算法的正确性和有效性。
Multi-objective flexible shop scheduling problem has always been an academic problem, the issue of parallel machines is seldom discussed. A mathematical model of multi-objective flexible shop scheduling based on parallel machine is established. The objective function is to minimize the maximum completion time and processing cost. Different from the previous intelligent optimization algorithm, a simple pareto-based optimization algorithm is proposed. The algorithm mainly consists of two modules: processing sequence module and machine selection module, in which machine selection module based on pareto optimization algorithm. Finally, numerical experiments show that the algorithm is correct and effective.