Study Guide - Operations Scheduling Solutions

Study Guide - Operations Scheduling Solutions - Study Guide...

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

View Full Document Right Arrow Icon
Study Guide -- Operations Scheduling Solutions Question 1: Suresh Gupta  now faces an operations sequencing problem in his shop. He has five jobs  that require his time. The table below contains information about five jobs waiting for  Suresh's attention. JOB Processing Time (days) Due Date A 15 40 B 14 36 C 20 44 D 25 28 E 22 42 a) Develop a Shortest Processing Time (SPT) sequence for Suresh, and calculate job  completion flow times, and tardiness. Sequence No. Job Duration Job Flow Time Due Date Tardiness 1 B 14 14 36 0 2 A 15 29 40 0 3 C 20 49 44 5 4 E 22 71 42 29 5 D 25 96 28 68 Total 259 102 Average Flow Time per Job =  259/5 = 51.8 days/job Makespan =  96 days Average No. of Jobs in the System =  259/96 = 2.698 jobs No. of Jobs Tardy =  3 jobs Average Tardiness per Job =  102/5 = 20.4 days/job
Background image of page 1

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

View Full DocumentRight Arrow Icon
BK, 2/5 b) Develop an Earliest Due Date (EDD) sequence for Suresh, and calculate job 
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/07/2008 for the course MGT 303 taught by Professor Kazaz during the Fall '06 term at University of Miami.

Page1 / 5

Study Guide - Operations Scheduling Solutions - Study Guide...

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

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