Assignment 4
Uploaded by
Dr. Abhinav GoelAssignment 4
Uploaded by
Dr. Abhinav GoelASSIGNMENT 4
Course: BCA Vth Sem
Subject: Optimization Techniques
Subject Code: TBC 503
1. Define the followings:
i. General Assumption to solve Sequencing Problem
ii. Graphical Method
iii. Sequencing
iv. Johnson’s Method
2. Find the sequence that minimize the total elapsed time require to complete the jobs. Also
calculate idle time for each machine.
(i)
JOB 1 2 3 4 5 6
Machine A 2 5 4 3 2 1
Machine B 6 8 1 2 3 5
(ii)
JOB 1 2 3 4 5
Machine I 4 9 8 6 5
Machine II 5 6 2 3 4
Machine III 8 10 6 7 11
(iii)
JOB A B C D E F G
Machine M1 12 6 5 11 5 7 6
Machine M2 7 8 9 4 7 8 3
Machine M3 3 4 1 5 2 3 4
(iv)
JOB A B C D E
Machine I 10 12 8 15 16
Machine II 3 2 4 1 5
Machine III 5 6 4 7 3
Machine IV 14 7 12 8 10
(v)
JOB A B C D
Machine M1 18 17 11 20
Machine M2 8 6 5 4
Machine M3 7 9 8 3
Machine M4 2 6 5 4
Machine M5 10 8 7 8
Machine M6 25 19 15 12
(vi)
JOB 1 2 3 4
Machine M1 7 6 5 8
Machine M2 5 6 4 3
Machine M3 2 4 5 3
Machine M3 3 5 6 2
Machine M3 9 10 8 6
3. Use Graphical method to minimize the time required to process the following jobs on the machines.
Also calculate the total elapsed time require to complete the jobs and idle time for each machine.
(i)
Job 1 Sequence A B C D E
Time (in hrs.) 6 8 4 12 4
Job 2 Sequence B C A D E
Time (in hrs.) 10 8 6 4 12
(ii)
Job 1 Sequence A C D B E F
Time (in 20 10 10 30 25 15
hrs.)
Job 2 Sequence A C B D F E
Time (in 10 30 15 10 15 20
hrs.)
