Consider the following instance of the job shop problem with the minimum makespan as the...
90.2K
Verified Solution
Link Copied!
Question
Accounting
Consider the following instance of the job shop problem with the minimum makespan as the objective where the processing times pij of jobs j=1, 2, 3 on machines i =1, 2, 3 are given in the table (Jm // Cmax)
Jobs
Machine Sequence
Processing Times
1
1,2
p11=9, p21=3
2
1,3
p12=5, p32=8
3
3,2
p33=7, p23=2
(a)Draw a disjunctive graph representation of the job shop including conjunctive and disjunctive relations.
(b)Apply the shifting bottleneck heuristic to this instance of the job shop problem with the aim of minimising the makespan.
(c) Draw the final schedule of the machines (Gannt Chart)
Answer & Explanation
Solved by verified expert
Get Answers to Unlimited Questions
Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!
Membership Benefits:
Unlimited Question Access with detailed Answers
Zin AI - 3 Million Words
10 Dall-E 3 Images
20 Plot Generations
Conversation with Dialogue Memory
No Ads, Ever!
Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!
