基于控制工序性质的LOB截止日期问题分析与算法

截止日期问题是重复性项目调度中研究最为广泛的问题之一，其旨在满足项目截止日期前提下求得一个工作队雇佣总量最小的调度方案。由于重复性项目往往为大型工程建设项目，一个准确的最优进度计划对于节约项目的资源和成本具有重要意义。在平衡线法(LOB)框架下，本文从控制工序的性质出发，研究并分析了控制工序工作队分配与项目总工期之间的关联，给出了截止日期问题的一些特殊性质。基于这些性质，一方面能够帮助项目管理人员判断一个调度方案是否可行且经济，另一方面能够得到一些有效的剪枝策略，从而设计出具有针对性的分支限界算法。最后，通过案例计算和仿真实验验证了本文提出的算法在计算效果和计算效率上的有效性。

Analysis and Algorithm for the Deadline Problem of LOB Based on the Property of Controlling Activity

The deadline problem is one of the most widely studied problems in repetitive project scheduling, which aims at minimizing the number of employed crews without exceeding a given deadline. In view of the large scale of repetitive projects, an exact optimal schedule plays an important role in saving resources and costs. This paper analyzes the relationship between the crew allocation and project completion time from the perspective of control activities properties in line of balance(LOB)method, and some special properties of the deadline problem are given. On the one hand, project managers could utilize these properties to evaluate the feasibility and cost-effectiveness of a repetitive project. On the other hand, some pruning rules could be obtained from these properties, leading to an effective branch and bound algorithm for obtaining the exact solution to the deadline problem. Finally, case analysis and simulation validate the calculation results and efficiency of the proposed algorithm.