具有交货期约束的并行多机车间调度研究  

Research on parallel machines scheduling with due dates restrains

作　　者：秦玮[1] 徐克林[1] 孙禹[1] 

机构地区：[1]同济大学机械工程学院,上海201804

出　　处：《现代制造工程》2011年第2期119-123,共5页Modern Manufacturing Engineering

摘　　要：针对有不同交货期约束的车间调度问题进行分析,提出一种求解并行多机车间调度问题的蚁群优化算法。利用改进后的有向无环图(DAG)来表达任务之间拓扑顺序,人工蚂蚁在该图中遍历可以得到任务的拓扑序。此算法包括订单任务列表的优化和机床分配策略的优化,衍生出两种概率公式的设计和两种信息素;并利用启发式信息保证截止时间最早的任务优先调度。最后将该方法应用于ABS阀体制造过程中,证实了该方法的有效性和可靠性。Aiming at job shop scheduling problems with different due dates restriction,proposes an Ant Colony Optimization（ACO） algorithm for solving the scheduling problem.Use DAG graph to express the topological order of these orders,the ants travel in the graph so to generate a topological order of all tasks.The algorithm consists of the optimization of tasks order and the optimization of the strategy of assigning the machines,generating two probability formulas and two types of pheromones.The algorithm makes sure the tasks with earliest due date to have the highest priority of scheduling.Finally the method is proved available and credible in ABS valve manufacturing.

关 键 词：有向无环图 交货期约束 并行加工 调度 蚁群算法 

分 类 号：F423[经济管理—产业经济]