CAJ | 학술논문

为了解决车间作业调度问题，在对其进行分析描述的基础上，提出了采用蜜蜂交配优化算法的求解方法。该方法把由多个作业调度方案组成的集合作为蜂群，以最小化加工时间作为算法的优化目标，通过模拟蜂群交配繁衍培养蜂王的优化过程来获得最优作业调度方案。采用车间作业调度测试案例在Matlab平台上进行实验，实验结果表明，该方法不仅能够有效地求解车间作业调度问题，而且能够取得了比传统优化方法更好的优化结果。
위료해결차간작업조도문제，재대기진행분석묘술적기출상，제출료채용밀봉교배우화산법적구해방법。해방법파유다개작업조도방안조성적집합작위봉군，이최소화가공시간작위산법적우화목표，통과모의봉군교배번연배양봉왕적우화과정래획득최우작업조도방안。채용차간작업조도측시안례재Matlab평태상진행실험，실험결과표명，해방법불부능구유효지구해차간작업조도문제，이차능구취득료비전통우화방법경호적우화결과。
To solve the Job-shop Scheduling Problem(JSP), a solution method-honey-bee mating optimization algorithm is presented on the basis of the JSP’s description. The method takes a set of job scheduling schemes as the bee swarm, and mini-mizing the processing time as the optimization goal. The optimal scheduling scheme is obtained by simulating the procedure of honey-bee mating. The test is carried out by the JSP test cases on Matlab. The experimental results show that this method can not only solve JSP but also find a better optimal scheduling scheme than the traditional optimization methods.