Job 1 2 3 4 5 6 7
Machine A 10 12 13 7 14 5 16
Machine B 15 11 8 9 6 7 16
i) Find the sequence that will minimize total completion time.
ii) Construct a chart of the resulting sequence and find machine B’s idle time.
Uploaded with ImageShack.us
Tuesday, June 21, 2011
Find the sequence that will minimize total completion time.
Seven jobs are to be processed on two machines; each job must follow the same sequence beginning with machine A and moving to machine B. The processing time in hours is as follows:
Job 1 2 3 4 5 6 7
Machine A 10 12 13 7 14 5 16
Machine B 15 11 8 9 6 7 16
i) Find the sequence that will minimize total completion time.
ii) Construct a chart of the resulting sequence and find machine B’s idle time.
Uploaded with ImageShack.us
Job 1 2 3 4 5 6 7
Machine A 10 12 13 7 14 5 16
Machine B 15 11 8 9 6 7 16
i) Find the sequence that will minimize total completion time.
ii) Construct a chart of the resulting sequence and find machine B’s idle time.
Uploaded with ImageShack.us
Tags :
Completion time
Subscribe to:
Post Comments (Atom)
