You are on page 1of 1

76 GENERAL FORMULATION FOR PROJECT SCHEDULING/COST OPTIMIZATION

Start-to-finish (SF) (is specified when the task has only one crew):
(5.8)
Finish-to-finish (FF) (is specified when both tasks have one crew only)
(5.9)
The quantities LSSij, LFSij, LSFij and LFFij are the respective time lags between task j and a previous task i. The
FS relationship can be used to ensure continuity from one task to another by specifying The
relationships represented by Eqs. (5.6)(5.9) can also be written for any given crew or segment of a task
rather than the whole task. For example, consider the case where crew B of task Y is the same as crew A of a
previous task X. Crew B can start work only after crew A has finished. Therefore, an FS relationship has to
be specified between crew A of task X and crew B of task Y.
Step 7: Define the space and/or time buffer between tasks. These constraints are essential if interference
of crews on different tasks is to be prevented. If task i precedes task j by a distance buffer BSij, the following
constraints have to be satisfied:
(5.10)

(5.11)

(5.12)

(5.13)
The term denotes the location of task i at the time
For tasks with a constant production rate during a segment of work, is found by a linear
interpolation between the values at the start ( ) and the finish ( ) of segment m performed by crew l of
task i.

(5.14)

Similarly, if task i precedes task j by the time buffer BTij, then we have the following constraints:
(5.15)

(5.16)

(5.17)

(5.18)
Likewise, is found by a linear interpolation between the starting time and the stopping time
for segment m performed by crew l of task i.

(5.19)

The optimization problem can now be formulated as the minimization of direct cost

You might also like