1. The Swift Corporation wants to schedule the following seven-job problem to be processed on two machines A and B. Each job must be processed by two machines A and B, first on machine A and then machine B. The operation processing times at machine A and B are as follows: Job i 1 2 3 4 5 6 7 Processing time on machine A (ai) 9 8 7 12 6 8 15 Processing time on machine B (bi) 6 5 7 19 12 11 7

a. Suppose jobs arrived in their natural order (i.e., job l before job 2, etc.), and FIFO systems of scheduling and processing the jobs is used. What is the completion time of each job and what is the total throughput time (makespan) of all jobs?

b. Suppose the inter-arrival times between jobs can be treated as zero and Johnson’s rule is used to sequence and process the jobs, what is the time of each job and what is the total throughput time (makespan) of all jobs?

c. What would be the difference in the average time a job spends in the shop in (a) and (b) above?

2. The Monroe Logistics Company would like to schedule its drivers to minimize the number of drivers used to cover the requirements over all seven days of the week. The company has 6 cabs but needs all six of them on duty only on Mondays and Fridays. The estimated requirements are as follows: Day Mon Tue Wed Thu Fri Sat Sun Requirements 6 4 4 4 6 3 3 Prepare a schedule that minimizes the total number of drivers needed and minimizes the amount of slack capacity while giving each driver two consecutive days off. In case of ties for assignment, it is preferred to give weekend days off. Identify the slack capacity for each day of the week. In addition, please identify the number of people working less than full-time (i, e., working less than five days a week).

Answer rating: 100% (QA)

i FIFO systems of scheduling and processing the jobs ... View the full answer