布局调度问题的聚合算法

Clustering Algorithm for Packing and Scheduling Problem

在分析布局调度问题的基础上 ,建立了布局调度问题的数学模型 .利用重复匹配算法、聚合算法等启发式方法 ,提出了布局调度操作的启发式规则及相应的启发式算法 .算例表明该算法能较好地解决布局调度问题 。

On the basis of studies of the packing and scheduling problems, a mathematical model for packing and scheduling problems is discussed and developed.Based on the idea of repeated matching and clustering arithmetic, the heuristic rules and heuristic algorithm for packing and scheduling problem are put forward. The calculating results show that the algorithm can solve the problems in some degree and the packing result is satisfactory.