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

This lesson throws light on question on N job - 3 Machine.

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
mam...what is eligibility criteria to give ibps exam please reply as soon as possible....
Karishma sahu
4 years ago
Any graduate can appear. Age limit is 27. Please check the website of IBPS.
Vikas Kumar
4 years ago
Hi Parakh, There are 3 eligibility criteria: 1) Age: Minimum - 20 Years & Maximum - 30 Years (As measured on 1st July 2016) 2) Qualification - Graduate in any discipline and result should have been declared before 1st August 2016 3) Nationality - Citizen of India or Subject of Nepal, Bhutan, Tibetan refugee Above criteria's are for general candidates. The government has given some age relaxation to reserved category candidates.
In, idle time for machine B ,from where 12 has come ? explain
sir , how can we solve a problem where none of the conditions are satisfied?
In such type of questions at least one condition will be satisfied
They will not ask different question bcoz only Johnson's algorithm is there in the syllabus

  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 JOBS3 MACHINES For applying Johnson's algorithm let 3 machines areA,B and C, then two conditions have to be checked. I. Min Ai > Max [Bi] 2. Min Ci Max [Bi] Of these atleast one or both are satisfied then n job and 3 machine problem can be converted into n job two machines X andY Such that Xi Ai Bi Yi Bi + Ci

  4. QUESTION Obtain an optimum sequence for the following set of job. Find the make span time and idle time for all the machines Jobs Machine A Machine B Machine C 7 12 . Min Ai Max [Bi] 2. Min Ci Max [Bi] => 5=5

  5. SOLUTION Jobs Machine (A + B) Machine (B + C) 10 10 16 10 12 10 7 15 1 4 7 6 2 35

  6. SOLUTION Machine B Machine C Machine A Out Out In Out In Jobs In 24 36 42 49 54 59 12 24 36 42 49 54 7 26 30 37 46 30 37 46 39 30 47 37 Make Span Time 59 Idle Time for Machine A 59 46 13 Idle Time for Machine B (3 2+ 5 +44+7 12) 37 Idle Time for i MMachineC- /