Abstract: This paper proposes a dynamic spatial scheduling approach based on Tree-Search to solve the assembling spatial scheduling problem in the large-sized discrete companies. The approach considers the spatial layout and the time scheduling simultaneously, and in the whole scheduling plan period, the algorithm is divided into two parts: the first is the pre-scheduling stage, the scheduling time is separated into the continual time-slices, and the block candidate set is got via the time constraint, the initial layout status is given at the same time; the second is the partial scheduling stage, with the Depth First Search, we perform the spatial layout search by the partial schedule algorithm in every time-slice, in order to get the optimal scheduling plan. This approach is simple and useful. Finally, the simulated experiment illustrates the validity of this approach.

Key words: Spatial layout, Dynamic spatial scheduling, Depth First Search

摘要： 针对大型离散企业产品组装空间调度问题，本文提出了一种基于树搜索的动态调度方法。该方法同时考虑了空间布置和时间调度两方面因素，在整个调度规划周期内，算法分成两部分：一是调度准备阶段，把调度时间分割成连续的时间段，并通过时间约束条件得到在每个分场地内需要组装的模块候选集,同时得到分场地的初始布局状态；二是局部调度阶段，通过深度优先树搜索的方法，在每个时间片内使用局部调度算法进行空间布置搜索，得出最优调度。该方法简单实用，最后，仿真实验说明了所提方法的有效性。

关键词: 空间布置, 动态空间调度, 深度优先搜索