{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

IE383_Assignment_10 (1)

# IE383_Assignment_10 (1) - 45 30 55 45 All jobs above must...

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

IE 383 Assignment 10 Due April 12, Monday Please keep two decimal points for all the results. Problem 1 (Please carefully follow the instructions and answer questions and subquestions in order) Job A B C D E F G H I Proc Time 7 6 5 14 8 4 5 10 9 Due Date 30 50 42 45 52 35 20 25 40 a) Assuming that all jobs arrive at time 0, generate a schedule that minimizes mean flow time using a table and a Gantt chart. Break ties with job index. Also determine the following measurements. -mean flow time -mean tardiness -maximum tardiness Job A B C D E F G H I Arr Time 0 42 20 20 0 5 0 12 13 b) Given the arrival time above, generate a schedule based on EDD using a table and a Gantt chart, and determine -mean flow time -mean tardiness -maximum tardiness Break ties with job index. c) Given the arrival time above, generate a schedule based on Critical Ratio using a table and a Gantt chart, and determine -mean flow time -mean tardiness -maximum tardiness Break ties with job index

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

View Full Document
Problem 2 Job A B C D E F G Processing time at M1 70 35 25 80 30 40 35 Processing time at M2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 45 30 55 45 100 65 20 All jobs above must go through two machines in a fixed order: from M1 to M2 . Find the optimal sequence that minimizes completion time. Show your process and use a Gantt chart to determine the completion time. Problem 3 Job A (due date: 16) M3 M1 M2 Processing Time 5 3 5 Job B (due date: 19) M2 M3 M4 Processing Time 3 2 4 Job C (due date: 18) M1 M3 M4 Processing Time 3 4 6 Job D (due date: 21) M4 M2 M1 M2 Processing Time 4 2 5 3 Job E (due date: 21) M2 M1 M2 M3 Processing Time 3 2 2 5 a) Assume all the jobs arrive at time 0. Generate a schedule using a Gantt chart based on SPT, and determine maximum tardiness. Break ties with job index. b) Assume all the jobs arrive at time 0. Generate a schedule using a Gantt chart based on Critical Ratio, and determine maximum tardiness. Break ties with job index....
View Full Document

{[ snackBarMessage ]}