摘要
在混合流水车间调度中,优化目标通常是makespan最小化,会使同一阶段同类机器设备的加工时间出现很大的差异,这对机器的管理、维护和折旧都不利,对操作人员也很不公平.因此建立了机器负荷平衡的数学模型,对问题的求解设计了一种新颖的免疫调度算法,可以将同阶段机器负荷控制在给定的差别范围内.对有无负荷平衡的两种调度结果进行了比较,并通过数值计算验证了该算法.
In hybrid flow shop scheduling, generally, the object of optimization is to get the makespan minimized, not considering differences of the same facilities＇ processing time during the same stage, which is disadvantageous for machines＇ maintenance and management and is unfair for manipulators. This paper formulates a load balancing model, sets forth a new immune algorithm for solving it. and compares two results for subjection and non-subjection to load balancing, and the computed result shows that the algorithm is an effective tool for such problems.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2006年第4期655-659,共5页
Journal of Xidian University
基金
国家科技部资助项目(2002E0691036)
关键词
混合流水车间
生产调度
负荷平衡
免疫算法
hybrid flow shop
production scheduling
load balancing
immune algorithm
