CAJ | 학술논문

为了解决无等待柔性车间调度的多目标优化问题，构建以最大完工时间、生产成本、总拖延时间为目标函数的多目标调度模型，结合灰色关联分析和熵理论，提出灰互信息适应度值分配策略，以评价Pareto解的优劣。在此基础上，运用遗传蜂群优化算法求解，该算法给出以关键路径为导向的变异操作，并将该变异操作和遗传算子中的IPOX和MPX交叉操作嵌入到人工蜂群算法中，以增强其全局寻优能力，提升搜索后期收敛速度。一个车间调度实验验证调度模型和算法的有效性和适应性。
위료해결무등대유성차간조도적다목표우화문제，구건이최대완공시간、생산성본、총타연시간위목표함수적다목표조도모형，결합회색관련분석화적이론，제출회호신식괄응도치분배책략，이평개Pareto해적우렬。재차기출상，운용유전봉군우화산법구해，해산법급출이관건로경위도향적변이조작，병장해변이조작화유전산자중적IPOX화MPX교차조작감입도인공봉군산법중，이증강기전국심우능력，제승수색후기수렴속도。일개차간조도실험험증조도모형화산법적유효성화괄응성。
To solve no-wait and multi-objective flexible flow shop scheduling problem(NWMFJSP), proposes an optimization model, which takes fin-ished time of maximum, machine cost and total delayed time as the objectives. Then presents the distribution strategy of the grey mutual information relational adaptive value combined with the grey correlation and information entropy to evaluate feasible solution. Based on it, applies genetic artificial bee colony algorithm(GABC) to solve the problem, the algorithm, which presents the mutation based on key path, embeds artificial bee colony with the nutation, IPOX and MPX crossover to enhance ability to search optimal solution globally and raise convergence rate in late search. The validity and adaptability of the scheduling structure and algorithm are proved by a case of job-shop scheduling.