CAJ | 학술논문

研究了相邻两加工阶段间等待时间受限的两阶段柔性流水车间调度问题，目标是使工件的总加权完工时间最小化。针对该NP难题，引入了惩罚函数法将约束问题转化为无约束问题，并利用一种改进的遗传算法求解该问题。通过仿真软件Matlab开发调度程序，仿真结果表明，该算法不仅具有较强的全局收敛性，且具有更快的寻优速度，是求解柔性流水车间调度的有效算法。
연구료상린량가공계단간등대시간수한적량계단유성류수차간조도문제，목표시사공건적총가권완공시간최소화。침대해NP난제，인입료징벌함수법장약속문제전화위무약속문제，병이용일충개진적유전산법구해해문제。통과방진연건Matlab개발조도정서，방진결과표명，해산법불부구유교강적전국수렴성，차구유경쾌적심우속도，시구해유성류수차간조도적유효산법。
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.