Job Shop Schedulling Flashcards
1
Q
Describe the Branch and Bounce Algorithm
A
Check notes
1
Q
Formulate the Disjunctive Programming Formulation
A
Check notes
2
Q
Describe the Shifting Bottleneck Heuristic
A
Check notes
3
Q
What are the basic assumptions of the job shop machine environment.
A
- Each job visits some or all of the machines
- One job at a time on each machine
- Each job follows a specific route (may differ for each job)