This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4. To get full credit for the problems , r efer to the rules also described in the syllabus and introduction slides Problem 1 Consider the following single machine scheduling problem where all jobs are available simultaneously at time zero: Job i 1 2 3 4 5 6 7 p(i) 5 18 12 8 10 17 16 d(i) 7 42 44 24 80 74 68 The processing time, due date of job i are denoted by p(i), d(i) respectively. Find the schedule that minimizes each of the following performance measures. Illustrate your schedule with a Gantt chart, and calculate the performance measure value a) Mean Flow Time. b) Maximum Tardiness. Problem 2 Chapter 8 Question 1 Problem 3 Chapter 8 Question 2 Problem 4 Chapter 8 Question 3 Problem 5 Chapter 8 Question 30 Problem 6 Chapter 8 Question 32...
View
Full
Document
This note was uploaded on 10/08/2011 for the course IE 383 taught by Professor Leyla,o during the Spring '08 term at Purdue UniversityWest Lafayette.
 Spring '08
 Leyla,O

Click to edit the document details