Variability management
7 important questions on Variability management
Considering a job shop what is:
- n
- m
- (i,j)
- pij
- n = jobs
- m = machines
- (i,j) operation, processing ob job j on machine i
- pij processing time operation (i,j)
What is the objective and goal of the job shop?
What is the equation used to describe a disjunctive graph?
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding
What do the following stand for on G = (N, A, B)
- N
- A
- B
- U
- V
- N nodes, for every operation (i,j) there is one node
- A Conjunctive arcs, order of operations of jobs
- B Disjunctive arcs, operations are done on the same machine are connected through arcs.
- U connected first jobs
- V connected last jobs
Consider a subset D on B
- When is it called a selection?
- When is the selection called a feasible selection?
- Called a selection if it contains from each pair of disjunctive arcs exactly one;
- When the resulting directed graph G(D) = (N, A on D) is acyclic;
What are [3] consequences of a feasible selection?
- A feasible selection leads to a sequence in which operations have to be processed;
- Each feasible selection leads to a feasible schedule;
- A feasible schedule induces a feasible selection;
How do you calculate the schedule for a selection in Job Shop?
- weight of the nodes is ( i, j ) bij pij and nodes U and V are 0
- length is the sum of the weight of the previous nodes
- An operation (i, j) starts at time lij
The question on the page originate from the summary of the following study material:
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding
![Trustpilot Logo](/images/design_2020/lp/clp-trustpilot-en.png)