Lines Matching refs:task
42 binaries associated with a given task start time
48 Based on the tentative assignments, find_bottleneck finds a task
50 tentative assignment feasible. In case a bottleneck task has a
101 task to start after the second has finished. On backtracking once it
104 to force the second task to start after the first.
114 Task1 = task with start:S1,
115 Task2 = task with [start:S2,duration:D2,resource:R2],
128 a single task
183 Otherwise, for each bottleneck task, it returns the tightest
265 These binaries represent the overlaps for a particular task
266 start time. The aim is to find the task to force apart from
267 the given task so as to reduce the number of overlapping tasks.
274 with task 2.
281 Task1 = task with [start:S1,duration:D1],
282 Task2 = task with [start:S2,duration:D2],
313 Based on the tentative assignments, <B>probe_search</B> finds a task
315 tentative assignment feasible. In case a bottleneck task has a