This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Homework 11 BUSQOM 1070, Spring 2011 Chapter 15 practice problems with solutions. This assignment is does NOT need to be turned in and will NOT be graded. From Chapter 15 (pages 611 614) in Heizer/Render 10 th Edition: Problem 15.10 Problem 15.11 Problem 15.12 Homework 11 Solutions 15.10 (a) FCFS (first come, first served): Because all jobs arrived on day 275, and presumably in the order given, the FCFS sequence is: A, B, C, D, E (b) EDD (earliest due date): Job Sequence Due Date B 312 A 313 D 314 E 314 C 325 (c) SPT (shortest processing time): Job Sequence Processing Time E 3 D 5 A 8 B 16 C 40 (d) LPT (longest processing time): Job Sequence Processing Time C 40 B 16 A 8 D 5 E 3 Scheduling Average Average Average Number Rule Tardiness Flow Time of Jobs in System FCFS 14.8 47.4 3.3 EDD 4.2* 34.6 2.4 SPT 4.2* 26.2* 1.8* LPT 20.8 60.2 4.2 * = Best Job Due Date Duration (Days) A 313 8 B 312 16 C 325 40 D 314 5 E 314 3...
View
Full
Document
 Spring '11
 Scala

Click to edit the document details