This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: IEE 533 1 Section 3.3 The Number of Tardy Jobs Prepared by: Jennifer McNeill IEE 533 2 Number of Tardy Jobs Due Date related objective Equivalent to the percentage of ontime shipments Performance measure often measured by managers Optimal Schedule for Takes the form of one set of jobs that will meet their due dates and that is scheduled first followed by the set of remaining jobs that will not meet their due dates First set of jobs will be scheduled according to EDD to make sure Lmax is negative The order of the second set of jobs is unimportant U j  1 IEE 533 3 Algorithm 3.3.1 Forward algorithm for solving Set J denotes the set of jobs already scheduled Set Jd denotes the set of jobs already considered for scheduling but will not meet their due dates and have thus been discarded Set Jc denotes the set of jobs not yet considered for scheduling U j  1 IEE 533 4 Algorithm 3.3.1 (contd) Step 1: Set J=0, Jd=0, and Jc={1, ,n} Step2: Let j* denote the job which satisfies Add j* to J Delete j* from Jc Go to Step 3 Step3: If Go to Step 4, otherwise let k* denote the job which satisfies Delete k* from J Add k* to Jd Step 4: If Jc=0 STOP Otherwise go to Step 2....
View
Full
Document
This note was uploaded on 10/07/2011 for the course IEE 533 taught by Professor Johnfowler during the Spring '10 term at ASU.
 Spring '10
 JohnFowler

Click to edit the document details