HW01-Sp10

HW01-Sp10 - MGMT 36100: HW 01 40 Points Due: January 27,...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
MGMT 36100: HW 01 40 Points Due: January 27, 2010 Show your calculations Submit one copy per group. Neatness is expected. Question 1(15 points – 2, 1, 2, 1, 2, 2, 2 and 3): A four-stage process consists of the following: machines B1 and B2 in parallel at stage 1, machine M1 at stage 2, then a buffer (F1), then machine D1 at stage 3 followed by machines G1 and G2 in parallel at stage 4. The processing times are (in minutes): B1: 9, B2: 9, M1: 6, D1: 5, G1: 8 and G2: 12. (a) Draw a neat process flow diagram. (b) What is the minimum TPT ? (c) What is the hourly capacity for each stage (round off to 2 decimal places)? (d) Identify the bottleneck stage and the process capacity . (e) Suppose you can add only one machine in parallel at the bottleneck stage. A machine with higher capacity costs more. You want to buy the least expensive machine. What should be the design cycle time for the new machine so that you increase the process capacity as much as possible ? Parts (f), (g) and (h) are based on the schedule described in part (f). (f) Jobs are numbered J1, J2, J3, J4 and so on. Odd numbered jobs are released to B1 starting at time 0 every 12 minutes (0, 12, 24, . .). Even numbered jobs are released to B2 starting at time 6 every 12 minutes
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/14/2010 for the course MGMT 361 taught by Professor Panwalker during the Spring '10 term at Purdue.

Page1 / 4

HW01-Sp10 - MGMT 36100: HW 01 40 Points Due: January 27,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online