D1 Definitions

  1. 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.
    Interfering float
  2. The percentage of time that the server of a queue is busy.
    Server utilisation
  3. 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.
    Bipartite graph
  4. A * in which no vertex is repeated.
  5. 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.
    Independent float
  6. Constraints that do not border the feasible region.
    Redundant constraints
  7. Ones where one can be stretched, twisted or otherwise distorted into the other.
  8. A graph in which at least one edge has a direction associated with it.
  9. An equation that relates the value of the objective quantity (which is to be maximised or minimised) to the decision variables in the problem.
    Objective function
  10. 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.
    Resource levelling
  11. A region on an x, y graph where all the constraints in a linear programming problem are satisfied.
    Feasible region
  12. A graph where a path exists between every pair of vertices.
    Complete graph
  13. An algoritm in which at each stage the immediately best option is chosen withoutbeing concerned about the long-term consequences of the choice.
    Greedy algorithm
  14. The rule by which a queue operates.
    Queuing discipline
  15. A simple graph in which every pair of vertices is connected by an edge.
    Connected graph
  16. The overall task to be analysed using critical path analysis made up of a number of different activities.
  17. Linear inequalities that restrict the values of the variables in the problem.
  18. A walk in which no edge is repeated.
Card Set
D1 Definitions
D1 definitions for MEI Maths