| 一种双目标带约束工件成类的平行机器调度启发式规则 |
| |
| 引用本文： | 曾相戈.一种双目标带约束工件成类的平行机器调度启发式规则[J].数学的实践与认识,2006,36(4):144-150. |
| |
| 作者姓名： | 曾相戈 |
| |
| 作者单位： | 北京理工大学管理与经济学院,北京,100081 |
| |
| 摘 要： | 提出了一种快速而有效的启发式规则(fam ily slack,简称FSLACK),来求解极小化总延误时间和极小化最大完工时间两个目标,工件按产品类型成组,带模具数量约束的平行机器生产调度问题.本文提出的FSLACK与EDD、LPT及SLACK进行了比较.随机订单的测试结果表明,本文提出的启发式规则在求解双目标带约束工件成类的平行机器调度问题上是有效的.这表明该算法可以应用在成型加工业的现场作业调度.
|
| 关 键 词： | 双目标 约束 成类 平行机器 启发式规则 |
| 修稿时间： | 2004年11月23 |
A Heuristic Algorithm for Solving a Bicriteria Scheduling Problem on Parallel Machines with Families and Constraint |
| |
| ZENG Xiang-ge.A Heuristic Algorithm for Solving a Bicriteria Scheduling Problem on Parallel Machines with Families and Constraint[J].Mathematics in Practice and Theory,2006,36(4):144-150. |
| |
| Authors: | ZENG Xiang-ge |
| |
| Abstract: | 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. |
| |
| Keywords: | bi-criteria constraint families parallel machines heuristics |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
