1. Business
  2. Operations Management
  3. please help with part e only thank you in advance...

Question: please help with part e only thank you in advance...

Question details
PLEASE HELP WITH PART E only! Thank you in advance!

Plcase show all writcn wock as 1 am having trouble tinding my way through the solution to this problem. Thank you in advance Question 4 (12 points: 1, 2, 2, 2, 5) Consider the three-stage process shown here (a) What is the minimum TPT? (b) Calculate hourly capacity of each stage. Wi Gi 6 min 6 min DI 4 min W2 5 min G2 6 min Consider the following schedule. Jobs are numbered 1, 2, 3, 4 and so on. Jobs are released in the process every four minutes (at 0, 4, 8. Odd numbered jobs go to W1 and G1 and even numbered jobs are scheduled on W2 and G2. Note that with this schedule you may or may not need buffers (c) Plot a Gantt chart using the diagram below (you can copy or cut and paste the diagram to your answer). Job 1 is already plotted for you. Plot jobs 2, 3, 4, 5, and 6. D1 (d) Assume that the system becomes stable after four jobs. What will be the (e) Calculate the WIP values in the table shown to the right. Then use WIP contributions average TPT based on jobs 1, 2, 3 and 4? D1 Littles law (and results from the calculations in earlier parts) to calculateFl the actual cycle time. W1 W2 F2 G1 G2 Total D1
a) The minimum TPT is 4 + 5 b) Stage : 60/4 15 units/hr 6= 15 min Stage 2: (1/6+1/5)*60-22 units/hr Stage 3: (1/6+1/6) 60-20s/hr Consider the following schedule. Jobs are numbered 1,2, 3, 4 and so on. Jobs are released in the process every four minutes (at 0, 4, 8). Odd numbered jobs go to W1 and Gl and even numbered jobs are scheduled on W2 and G2 Note that with this schedule you may or may not need buffers. c) 1 1 1 2 2 2 2 3 3 3 F2 G2 WIP Contributions: DI F2 G2 /8 otal 2&4 4+5+6 15 Average TPT- (16+15)/2 15.5 min As per Zookal policy we need to solve four sub parts per question. Please post the remaining questions in another post.
Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution