CAJ | 학술논문

针对柔性流水车间作业调度问题，考虑加工批量约束松弛和瓶颈工序顺序松弛2种情形，抽取出相应的新型柔性流水车间调度问题，建立了最小化最大完工时间的数学模型，提出了改进的单亲遗传算法，进行了优化求解，得到了不同约束松弛情况下的最优调度方案。通过算例仿真，验证了所提方法的有效性。
침대유성류수차간작업조도문제，고필가공비량약속송이화병경공서순서송이2충정형，추취출상응적신형유성류수차간조도문제，건립료최소화최대완공시간적수학모형，제출료개진적단친유전산법，진행료우화구해，득도료불동약속송이정황하적최우조도방안。통과산례방진，험증료소제방법적유효성。
Aiming at a new flexible flow shop scheduling ( FFSS) problem , it presents two relaxation constrains including process batch and sequence permutation ,establishes the new mathematical model with the objective of minimizing the maximal completion time of FFSS ,proposes a revised partheno genetic algorithm (PGA) and re -alizes scheduling optimization .Based on the proposed PGA, it obtains the different scheduling solution corre -sponding to the different relaxation constraints ,and simulates the numerical testing .The results demonstrate the feasibility and effectiveness of the proposed method .