最早开始时间

不确定工期条件下的工作流连续性仿真模型应用面向对象仿真和层次化建模的方法，在仿真模型中引入滞后缓冲节点以使工作流的最早开始时间延迟至指定的滞后缓冲值。

Proposed model which uses object orientation simulation and hierarchical modeling introduces lag buffer node in order to make the early start time of work flow delay to specified value of lag buffer .

算法力求保证每个节点的最早开始时间，通过这种调度方式获得整个任务的优化调度结果。

The algorithm tries to schedule each task node at its earliest start time to obtain good performance of the whole task .

将得到的每件工作的开始时间作为最早开始时间，那么就在最早开始时间和最晚开始时间，随机生成一个值，作为工作的实际开始时间作为资源均衡部分的基因编码。

Make the start time as the earliest time , then generating time between the earliest time and the latest time as the actual start time .

最后，以Job-Shop调度系统为例进行了仿真验证，结果表明，该算法可快速地判断约束网络的一致性，并计算每个工序的最早可能开始时间。

Taken the typical Job-Shop scheduling problem as an example , the simulation system is designed to verify the proposed algorithm , and the result has shown that it can quickly judge the consistence of the constraints and work out the earliest start time of the operator .

FORS算法采用最早最迟开始时间优先、最优化空白区域管理和配置重用的调度原则，能反映实时任务的紧迫度，快速地调度实时可配置硬件任务，同时有效的管理可重构资源。

The algorithm adopts the scheduling principle of earliest latest staring time first , which will reflect different emergency levels of real time tasks . The algorithm constructs a fast and correct empty resource management and is based on configuration reuse .

它研究在满足逻辑关系和资源约束的前提下，求得活动的最早开始和结束时间，达到工程项目工期最短的优化目标。

It is research on the activities of the schedule that the logical relationship and the resource constraints are satisfied while optimizing the managerial objective and makes the time limit shortest .