摘要
提出了一种快速而有效的启发式规则(fam ily slack,简称FSLACK),来求解极小化总延误时间和极小化最大完工时间两个目标,工件按产品类型成组,带模具数量约束的平行机器生产调度问题.本文提出的FSLACK与EDD、LPT及SLACK进行了比较.随机订单的测试结果表明,本文提出的启发式规则在求解双目标带约束工件成类的平行机器调度问题上是有效的.这表明该算法可以应用在成型加工业的现场作业调度.
A quick and efficient heuristic algorithm is proposed in this paper to solve parallel machines bi-criteria scheduling problem with families and constraint of mold＇s number. The algorithm is compared with benchmark methods, EDD, LPT and SLACK by using random orders. It is shown that the algorithm performs better than EDD, LPT and SLACK to solve the problem. So the algorithm could be applied in molding manufacturing.
出处
《数学的实践与认识》
CSCD
北大核心
2006年第4期144-150,共7页
Mathematics in Practice and Theory
关键词
双目标
约束
成类
平行机器
启发式规则
bi-criteria
constraint
families
parallel machines
heuristics
