Spare time associated with an activity which, if used, may delay the other activities with which it shares * float, but will not delay the overall completion time of the project.
The percentage of time that the server of a queue is busy.
A graph in which the vertices fall into two sets, and each edge has a vertex from one set at one end, and a vertex from another set at the other end.
A * in which no vertex is repeated.
Spare time associated with a particular activity which can be used without delaying the start of any other activity, or the overall completion time of the project.
Constraints that do not border the feasible region.
Ones where one can be stretched, twisted or otherwise distorted into the other.
A graph in which at least one edge has a direction associated with it.
An equation that relates the value of the objective quantity (which is to be maximised or minimised) to the decision variables in the problem.
The process of juggling the activities on the cascade chart to minimise the maximum quantity of a given resource that is needed for a project, and even up the used of a given resource throughout the duration of the project.
A region on an x, y graph where all the constraints in a linear programming problem are satisfied.
A graph where a path exists between every pair of vertices.
An algoritm in which at each stage the immediately best option is chosen withoutbeing concerned about the long-term consequences of the choice.
The rule by which a queue operates.
A simple graph in which every pair of vertices is connected by an edge.
The overall task to be analysed using critical path analysis made up of a number of different activities.
Linear inequalities that restrict the values of the variables in the problem.