6-64. (Job shop scheduling) Three jobs, J1, J2, and J3, are processed on three machines, M1, M2, and M3, according to the following sequences (processing times are shown in parentheses): J1: M3(3) J2: M2(1) - - - M1(4) – M2(6) - M3(5) – M2(9) - - J3: M3(8) – M2(8) – M1(7) The order in which the jobs are processed on the different machines is predetermined as: M1: J1 J2 J3 - - M2: J2 J3 - J1 - M3: J3 J1 J2 - - a. Represent the problem as a CPM network for which the critical path determines the make span of all three jobs. b. Use the critical path calculations to develop the scheduling of the jobs (Gantt chart), assuming that each operation is scheduled at its earliest start time.
6-64. (Job shop scheduling) Three jobs, J1, J2, and J3, are processed on three machines, M1, M2, and M3, according to the following sequences (processing times are shown in parentheses): J1: M3(3) J2: M2(1) - - - M1(4) – M2(6) - M3(5) – M2(9) - - J3: M3(8) – M2(8) – M1(7) The order in which the jobs are processed on the different machines is predetermined as: M1: J1 J2 J3 - - M2: J2 J3 - J1 - M3: J3 J1 J2 - - a. Represent the problem as a CPM network for which the critical path determines the make span of all three jobs. b. Use the critical path calculations to develop the scheduling of the jobs (Gantt chart), assuming that each operation is scheduled at its earliest start time.
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter12: Queueing Models
Section: Chapter Questions
Problem 59P
Related questions
Question
Kindly give me a detailed response.
Please make the solution a manual for me and not a software solution if possible.
Thank you very much.
![6-64. (Job shop scheduling) Three jobs, J1, J2, and J3, are processed on three
machines, M1, M2, and M3, according to the following sequences (processing
times are shown in parentheses):
J1: M3(3)
M1(4) - M2(6)
J2: M2(1)
M3(5) – M2(9)
J3: M3(8)
M2(8) – M1(7)
The order in which the jobs are processed on the different machines is
predetermined as:
M1: J1 J2 J3
M2: J2
J3 - J1
M3: J3
J1 - J2
a. Represent the problem as a CPM network for which the critical path
determines the make span of all three jobs.
b. Use the critical path calculations to develop the scheduling of the jobs
(Gantt chart), assuming that each operation is scheduled at its earliest
start time.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe6ea8544-3db1-4bc7-88f6-b1853a039d3c%2F457fe16b-a510-4938-87e8-a4cc4fceca2e%2F16d4dih_processed.png&w=3840&q=75)
Transcribed Image Text:6-64. (Job shop scheduling) Three jobs, J1, J2, and J3, are processed on three
machines, M1, M2, and M3, according to the following sequences (processing
times are shown in parentheses):
J1: M3(3)
M1(4) - M2(6)
J2: M2(1)
M3(5) – M2(9)
J3: M3(8)
M2(8) – M1(7)
The order in which the jobs are processed on the different machines is
predetermined as:
M1: J1 J2 J3
M2: J2
J3 - J1
M3: J3
J1 - J2
a. Represent the problem as a CPM network for which the critical path
determines the make span of all three jobs.
b. Use the critical path calculations to develop the scheduling of the jobs
(Gantt chart), assuming that each operation is scheduled at its earliest
start time.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 5 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Practical Management Science](https://www.bartleby.com/isbn_cover_images/9781337406659/9781337406659_smallCoverImage.gif)
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
![Practical Management Science](https://www.bartleby.com/isbn_cover_images/9781337406659/9781337406659_smallCoverImage.gif)
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,