Tasks may be scheduled to run continously, at a single period in time, or multiple recurring periods in time.
Figure 21 illustrates an instance diagram.
![]() |
Figure 21 — Task Scheduling |
This concept is used by entities for exchanges as shown.
IfcTask | X X |
X X |
X X |
X X |
X X |
X X |
X X |
X X |
X X |
X X |
X X |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |
O O |