General Flashcards

1
Q

Must write reject

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Curved lines do not matter much

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Dummy -

A

describe both events uniquely in terms of the events at each end

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Route inspection - start=stop point

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Check for integers + sub into objective function if needed

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What must be happening on day x -

A

check the time it happens i.e. if at 1pm draw vertical line in centre of day x and day x+1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Critical path first node 1 not 0

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

For matchings write what is unmatched

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Counts if vertical line at end of box on cascade chart

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

For profit line test at least 2/3 points

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Check question e.g. state weights/lengths

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Finding shortest route for Dijsktra’s -

A

trace back from end node including arc XY if Y already lies on the path and the difference of the final values of X and Y equals the weight of arc XY

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

All critical activities at top of cascade chart

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

To see min number of workers in time period find total available hours in that time + total time needed to be done for activities on cascade chart

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

remember x,y >= 0 and integer solutions

A

/

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

LB of workers - use cascade chart as more accurate (larger than weight of graph/critical path)

A

/

17
Q

First fit decreasing algorithm must do what

A

reorder into decreasing order

18
Q

Binary search must already be

A

ordered

19
Q

Vertex/edge set =

A

list of vertices/edge

20
Q

Full bin -

A

combinations to fill then first fit algorithm

21
Q

Handshaking lemma

A

sum of degrees = 2 * sum of edges

so cant have odd number of odd nodes as odd+odd = odd not even

22
Q

Linear programming formulation

A

define d.v.
state o.f.
write constrains

23
Q

Why is LB not always write for critical network

A

does not account for the degree of overlap of the activities

24
Q

Scheduling diagram =

A

combined Gantt chart shading where a worker is inactive

25
Q

Scale shows elapsed time e.g. 1st hour is 0-1 2nd hour is

A

1-2

26
Q

For day x draw line at

A

x-0.5

27
Q

Must means

A

critical activities and ones that cant escape by float

28
Q

may means

A

only float not critical

29
Q

Bottom >=top

A

/

30
Q

Use dummy activity when 2+ activities depend on a common activity but not the same set of activities i.e.

A

D depends on A
E depends on A and B
Therefore dummy needed