Unformatted text preview: IEOR 150, Fall 2010 Homework 6 When you applies SPT or EDD, use FCFS to break tie. 1. Five jobs must be scheduled for processing on a mainframe computer system. The processing times and the promised times for each of the jobs are listed below. Assume job i is received before job j if i < j . Job 1 2 3 4 5 Processing time 45 min 2.5 hr 30 min 4 hr 1.5 hr Promised time 11:00 AM 2:00 PM 2:00 PM 1:00 PM 4:00 PM Assume that the current time is 10:00 AM. (a) Schedule the jobs according to FCFS and find the tardiness and flow time of each job. Also find the mean tardiness, maximum tardiness, and the total flow time. (b) Repeat the calculation in Part (a) for EDD scheduling. (c) Repeat the calculation in Part (a) for SPT scheduling. 2. Consider a single-machine scheduling problem with n > 1 jobs and deterministic processing time. Let W i , F i , L i , t i , and d i be the waiting time, flow time, lateness, processing time, and due time of job i ....
View Full Document
- Fall '09
- Hour, Equivalence, Book of Job