2 Machine flow
|
The times required to complete each of eight jobs in a two-machine flow shop are shown in the table that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B. |
|
TIME (hours) |
||
| Job | Machine A | Machine B |
| a | 16 | 5 |
| b | 3 | 13 |
| c | 9 | 6 |
| d | 8 | 7 |
| e | 2 | 14 |
| f | 12 | 4 |
| g | 18 | 14 |
| h | 20 | 11 |
|
|
||
| a. | Determine a sequence that will minimize makespan time. |
| The sequence is . |
| b. | Find machine B’s idle time. |
| Idle time | [removed] hrs |
| c. |
For the sequence determined in part a, how much would machine B’s idle time be reduced by splitting the last two jobs in half? |
| New idle time [removed] hrs, savings of [removed] hrs. |