等待时间受限的两阶段柔性流水车间调度

摘要

In this paper, we studied the two-echelon flexible dispatching problem of flow shops when there was limited waiting time between two adjacent processing links, the objective of which was to minimize the total weighted working time. Then we introduced an improved genetic algorithm to solve the problem and used the Matlab program to simulate it.%研究了相邻两加工阶段间等待时间受限的两阶段柔性流水车间调度问题，目标是使工件的总加权完工时间最小化。针对该NP难题，引入了惩罚函数法将约束问题转化为无约束问题，并利用一种改进的遗传算法求解该问题。通过仿真软件Matlab开发调度程序，仿真结果表明，该算法不仅具有较强的全局收敛性，且具有更快的寻优速度，是求解柔性流水车间调度的有效算法。