The Kandy Company 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 Bare 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?
The Kandy Company 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 Bare as follows:
|
Job i |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
|
Processing time on Machine A ( |
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
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?
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 6 images
