Job Shop scheduling - Shifting Bottleneck
4 important questions on Job Shop scheduling - Shifting Bottleneck
In the SB what are M and M0
M0 = fixed set of machines on M
In G' = (N, A') what is
- N
- A'
A' = all conjunctive and disjunctive arcs corresponding to the schedules of machines in M0
Give a remark about parallel/sequenced scheduling of operations on machines M\M0 with respect to G'
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding
How do you try to reduce the makespan for the schedule of M0 ?
Consider the machines of M0 one by one in the sequence they were added. Remove the schedule and calculate a new schedule based o the earliest starting times and delays resulting form the other machines.
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