Job Shop Schedulling Flashcards

1
Q

Describe the Branch and Bounce Algorithm

A

Check notes

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

Formulate the Disjunctive Programming Formulation

A

Check notes

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

Describe the Shifting Bottleneck Heuristic

A

Check notes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly