求解混合多处理机任务作业车间调度的改进粒子群算法

被引:13
作者
翟亚飞
樊坤
王蒙
李心宁
机构
[1] 北京林业大学经济管理学院
关键词
粒子群算法; 混合车间调度; 多处理机任务; 作业车间调度;
D O I
暂无
中图分类号
TP18 [人工智能理论]; TB497 [技术管理];
学科分类号
083803 [交通管理工程]; 140502 [人工智能];
摘要
针对车间生产制造中,工件的一道加工工序需要不止一台处理机(工人、设备等)同时加工处理的情景,建立了混合多处理机任务作业车间调度模型,并针对粒子群算法容易陷入局部最优提出一套改进粒子群算法用于求解该问题.其中,对粒子群算法的改进工作包括:提出编码机制和解码机制、设计迭代机制和为了尽量避免早熟而引进的变异机制.利用提出的改进粒子群算法对JSP问题经典算例进行求解,以验证该算法的有效性与稳定性,之后对混合多处理机任务作业车间调度问题的算例进行仿真分析,实验结果表明该算法有效提高了处理机的利用率,缩短了最大完工时间.
引用
收藏
页码:2107 / 2113
页数:7
相关论文
共 17 条
[1]
离散制造企业批量生产车间调度智能优化研究 [D]. 
曾强 .
重庆大学,
2010
[2]
An effective new island model genetic algorithm for job shop scheduling problem.[J].Mohamed Kurdi.Computers and Operations Research.2016,
[3]
An effective immune algorithm based on novel dispatching rules for the flexible flow-shop scheduling problem with multiprocessor tasks.[J].Ye Xu;Ling Wang;Shengyao Wang;Min Liu.The International Journal of Advanced Manufacturing Technology.2013, 1-4
[4]
An effective modified binary particle swarm optimization (mBPSO) algorithm for multi-objective resource allocation problem (MORAP).[J].Kun Fan;Weijia You;Yuanyuan Li.Applied Mathematics and Computation.2013,
[5]
A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan.[J].Hui-Mei Wang;Fuh-Der Chou;Ful-Chiang Wu.The International Journal of Advanced Manufacturing Technology.2011, 5-8
[6]
An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems.[J]..Applied Soft Computing Journal.2010, 3
[7]
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms.[J].Leila Asadzadeh;Kamran Zamanifar.Mathematical and Computer Modelling.2010, 11
[8]
Multiple colony ant algorithm for job-shop scheduling problem [J].
Udomsakdigool, A. ;
Kachitvichyanukul, V. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (15) :4155-4175
[9]
Feasible job insertions in the multi-processor-task job shop.[J]..European Journal of Operational Research.2006, 3
[10]
A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks [J].
Oguz, C ;
Ercan, M .
JOURNAL OF SCHEDULING, 2005, 8 (04) :323-351