Assignment:
For a two-machine shop the following jobs and their processing time (hours) are identified. Each job must follow the same sequence, starting with Machine A and moving to B.
a. Identify the sequence that minimizes the makespan time.
b. Construct a chart of the sequence, and find Machine B's idle time.
|
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
|