An Efficient Job Shop Scheduling Algorithm Based on Artificial Bee Colony
文件大小: 866k
源码售价: 10 个金币 积分规则     积分充值
资源说明:The job shop scheduling problem (JSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a discrete artificial bee colony based memetic algorithm, named DABC, is proposed for solving JSSP. Firstly, to make artificial bee colony (ABC) suitable for solving JSSP, we present a food source as a discrete job permutation and use the discrete operation to generate a new neighborhood food source for employing a bee colony, an onlooker bee colony and a scout bee colony.
本源码包内暂不包含可直接显示的源代码文件,请下载源码包。