Sign up now
to enroll in courses, follow best educators, interact with the community and track your progress.
N Job - 2 Machine (Sequencing) (in Hindi)
684 plays

This lesson throws light on N jobs - 2 machines.

Harshit Aggarwal
Cleared UPSC ESE twice with Rank 63 and 90 in mechanical engg. Got 99 percentile in GATE. Cracked ONGC, BHEL,ISRO, SAIL, GAIL successfully

Unacademy user
u r just superb. ..
jase B machine ka ideal time nikala wase A machine ka kyu ni nikala wo bhi to free rahi h jab B machine work kr rahi thi to fir A ka ideal time only 1 day kase hua?
Chanderveer Singh
6 months ago
Kya baat hai!!!
5 months ago
I think a ka ideal uske jaisa iske liye nahi nikala q ki when Machine a will work then after B will work or indirectly When machine not completing it work vo machone b ko d deta hai like see in Problem when job E is in process then Machine a is giving task to machine b and then process started
5 months ago
or If this reason wrong the right reason will be machine b will be ideal because there is no need for machine b to work thankyou

  2. ABOUT ME Graduated from NIT Nagpur in 2008 Cleared Engineering Services Examination (ESE-UPSC) Exam Got the offer letter from most of the Maharatna and Navratna Companies Cleared GATE Exam Rate, Review, Recommend, Share Follow me on Unacademy at: aggarwal

  3. N JOBS 2 MACHINES Machine A Machine B Jobs Ai Bi B2 A4 B4 An Bn

  4. N JOBS2 MACHINES In this problem 2 machines A and B are involved and each job is numbered.i 1,2,3,...N. and each job has its processing time on machine A and B denoted by Ai and Bi respectively. The problem is to find a processing order for different jobs so that the idle time for both the machines is minimised. This is done by using Johnson's Rule or Johnson's algorithm The steps involved are: l. Find out the minimum of Ai and Bi. 2. If minimum is for Ar i.e. for the rth job on machine A then do the rth job first. 3. If minimum is for Bs i.e.for the sth job on machine B then do the sth job at the last. 4. In case of tie between Ar and Bs. Perform the rth job first and the sth job at the last. 5. After a job is assigned in a sequence, strike it off so that it can't be considered again. 6. Continue in this manner until all the jobs are assigned.

  5. QUESTION Apply Johnson's algorithm and find the optimal sequence for the following set of jobs. Also find the make span time, idle time for each machine, percentage utilisation of each machine and prepare Gantt chart for both the machine. Jobs Machine A Machine B 4 C B D EA F

  6. SOLUTION Machine A Machine B Jobs In Out In Out . Percentage utilisation of Machine A 35/36 * 100 97.2% Percentage utilisation of Machine Be 28/36 * 100 = 77.7% 20 27 35 26 30 36 20 27 27 35 idle time for machine A Idle time for machine B 2+1+5-8 Make Span Time = 36 04 2 3 4 S6789 lo ll 12131Y/SIGI :" 20212223242526, 729 2930 a2833d 6

  7. IMPORTANT EXAMPLE If Jobs A Here we have to decide for machine A and for machine A minimum is from eginning 4 13 9 13 If Jobs A Here we have to decide for machine B and for machine B minimum is from last 13