Scribd
Upload
144 views

B.C.A. - 5 Sem: Assignment: Unit-4 Job Sequencing

The document provides instructions and data for six job sequencing problems to minimize total elapsed time. Students are asked to define key terms related to job sequencing, find the optimal sequence and idle times for machines, and use a graphical method to analyze two additional job sequencing problems.

Uploaded by

bomejeb102
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
144 views

B.C.A. - 5 Sem: Assignment: Unit-4 Job Sequencing

The document provides instructions and data for six job sequencing problems to minimize total elapsed time. Students are asked to define key terms related to job sequencing, find the optimal sequence and idle times for machines, and use a graphical method to analyze two additional job sequencing problems.

Uploaded by

bomejeb102
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

B.C.A.

-5th Sem
Assignment: Unit-4
Job Sequencing
Attempt all the questions:
1. Define the following:
i. General Assumption to solve Sequencing Problem iii. Sequencing
ii. Graphical Method 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) (iv)
JOB 1 2 3 4 5 6 JOB A B C D E
Machine A 2 5 4 3 2 1 Machine I 10 12 8 15 16
Machine B 6 8 1 2 3 5 Machine II 3 2 4 1 5
(ii) Machine III 5 6 4 7 3
JOB 1 2 3 4 5 Machine IV 14 7 12 8 10
Machine I 4 9 8 6 5 (v)
Machine II 5 6 2 3 4 JOB A B C D
Machine III 8 10 6 7 11 Machine M1 18 17 11 20
(iii) Machine M2 8 6 5 4
JOB A B C D E F G Machine M3 7 9 8 3
Machine M1 12 6 5 11 5 7 6 Machine M4 2 6 5 4
Machine M2 7 8 9 4 7 8 3 Machine M5 10 8 7 8
Machine M3 3 4 1 5 2 3 4 Machine M6 25 19 15 12

(vi)
JOB 1 2 3 4 5 6 7
Machine M1 3 12 15 6 10 11 9
Machine M2 8 10 10 6 12 1 3

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 hrs.) 20 10 10 30 25 15
Job 2 Sequence A C B D F E
Time (in hrs.) 10 30 15 10 15 20

You might also like