Unformatted text preview: IOE 543: Scheduling HW #9 (Due at beginning of class Tuesday, April 20, 2010) 1. The following jobs are processed on 3 identical parallel machines. Jobs have processing times, Xi, i = 1, …, n, which are exponentially distributed with rate = 4 (same rate for all jobs). The due dates occur at times, Yi, which are exponentially distributed with rates i. Formulate and solve the assignment which minimizes the expected weighted tardiness E( wjUj). Give the order in which the jobs are to be scheduled as well as the expected cost. Job 1 2 3 4 5 6 7 8 9 wj 6 8 5 10 2 4 8 12 3 j 5 4 12 2 1 15 11 16 4 2. Consider a two machine job shop. Jobs 1, 2, and 3 are processed first on machine 1 then on machine 2. Jobs 4, 5, and 6 are processed first on machine 2 then on machine 1. The goal is to minimize the expected makespan. Processing times are exponential with rate ij, where i is the machine and j is the job [units = jobs/hr]. Find an optimal schedule and calculate the expected makespan. Job 1 2 3 4 5 6 1j 2j 5 8 2 7 11 8 4 3 6 9 7 2 3. A project is currently underway. The budgeted cost of work scheduled at this point is $23M. The budgeted cost of work performed is $18M. To date, $16M has been spent. a. Calculate the schedule variance and cost variance. b. Is the project ahead or behind schedule? c. Is the project over budget or under budget? ...
View
Full Document
 Spring '12
 Richard
 identical parallel machines.

Click to edit the document details