부산대학교 도서관

Spatial scheduling aims to create efficient spatial utilization and optimal temporal scheduling. In this paper a spatial scheduling approach based on an improved particle swarm optimization algorithm was proposed to determine the optimal processing sequence and spatial location of blocks. To minimize processing time and maximize spatial utilization, the adaptive inertia weight strategy was used to ensure the algorithm converged. Selection operator and mutation operator were used in the algorithm to improve the convergence rate and to prevent locally optimal solution. Heuristic positioning strategy was developed to determine the location of blocks. Finally, a simulation was examined to show the validity of the proposed algorithm.