计算机工程与应用Issue(13)：262-265,4.DOI:10.3778/j.issn.1002-8331.1303-0193
蜜蜂交配优化算法在车间作业调度中的应用
Application of honey-bee mating optimization algorithm to job-shop scheduling
摘要
Abstract
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.关键词
蜜蜂交配优化算法/车间作业调度问题/组合优化Key words
honey-bee mating optimization algorithm/Job-shop Scheduling Problem(JSP)/combinatorial optimization分类
信息技术与安全科学引用本文复制引用
李小霞,刘峰,刘建晓..蜜蜂交配优化算法在车间作业调度中的应用[J].计算机工程与应用,2013,(13):262-265,4.基金项目
武汉大学软件工程国家重点实验室开放研究基金（No.SKLSE2012-09-24）；华中农业大学新进博士科研启动专项（No.52902-0900206084， No.52902-0900206081）；高等学校博士学科点专项科研基金新教师类资助课题（No.20120146120002）；中央高校基本科研业务费专项资金资助项目（No.2013PY118）。 （）
