MT2_2000SOLUTION

MT2_2000SOLUTION - ISE 514 FALL 2000 GEZA BOTTLIK 11/14/00...

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

View Full Document Right Arrow Icon
ISE 514 FALL 2000 11/14/00 GEZA BOTTLIK MIDTERM No. 2 Solution PROBLEM No. 1 A factory plans it's production on the basis of fixed flow times. Experience indicates that if the factory uses 2 times the total processing time as the flow time, it usually comes close to making the due dates. The factory is a flow shop consisting of 3 machines, and has received a request for the following jobs: Job Units per job Processing time per unit Due date M1 M2 M3 J1 2 1 2 1 15 J2 2 3 1 2 22 J3 1 1 3 2 12 J4 2 2 1 2 22 J5 3 2 2 1 30 a) What are the required and practical ready times (show your work)? (15 points) r1 = 15 - 2*2*(1+2+1) = -1 == 0 r2 = 22 - 2*2*(3+1+2) = -2 == 0 r3 = 12 - 1*2*(1+3+2) = 0 r4 = 22 - 2*2*(2+1+2) = 2 r5 = 30 - 3*2*(2+2+1) = 0 b) Make up a schedule. Will these ready times and your schedule result in on time deliveries? Show your work? If not, what is the average tardiness? (10 points) I would go for a non-delay with EDD as a tie breaker if I had time, else just use EDD (3 - 1 - 2 - 4 -5) and produce a Gantt chart: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 M1 J3 J1 J2 J4 J5 M2 J3 J1 J2 J4 J5 M3 J3 J1 J2 J4 J5 None of the jobs are tardy, but they are for the most part quite early - not very desirable. Problem No. 2 Kinko’s has asked you to give them some advice on how to schedule their newest group of machines at one of their larger shops– four expensive fast copiers they have bought from Kodak. Their objective is to complete all the jobs available at the start of a day as soon as possible. In addition, they want to be able to tell a customer who walks in during the day when the latest time that his/her job will be done. Describe what you would recommend and why. (20 points) The four machines are parallel machines. Since we know the approximate length of the jobs that we already have, we would create an LPT Schedule. As a new job arrived, we would take the unstarted jobs and combine them with the new job to
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.

Page1 / 4

MT2_2000SOLUTION - ISE 514 FALL 2000 GEZA BOTTLIK 11/14/00...

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