Job Shop scheduling - Branch and bound
6 important questions on Job Shop scheduling - Branch and bound
When is a schedule active?
What does the set of all active schedules contain?
What does this represent and give the formula
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding
What happens with disjunctions when applying branching?
How do you calculate a simple lower bound of node v with their fixed disjunction D' ?
How can you find a better lower bound?
- Considering one machine i that needs to be scheduled;
- All unscheduled operations on the other machines can be done in parallel, but unscheduled operation on machine I needs to be sequenced;
- Solve optimally
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