Mechanical Engineering Exam > Mechanical Engineering Questions > Which of the following minimizes the idle ti...
Start Learning for Free
Which of the following minimizes the idle time of an n-jobs and 2 machine problem?
- a)SPT rule
- b)Johnson’s algorithm
- c)EDD rule
- d)Critical ratio rule
Correct answer is option 'B'. Can you explain this answer?
Most Upvoted Answer
Which of the following minimizes the idle time of an n-jobs and 2 mac...
Johnson's Algorithm Minimizes Idle Time in 2-Machine Problem
Johnson's algorithm is an efficient way to minimize the idle time of an n-jobs and 2 machine problem. The algorithm is used to schedule jobs on two machines, such that the idle time on both machines is minimized. It is a greedy algorithm that works by selecting the job with the smallest processing time on either machine.
Steps of Johnson's Algorithm:
1. Transform the n-jobs and 2 machine problem into a modified 3-machine problem by adding a dummy machine with processing time 0 for each job.
2. Determine the processing time of each job on machine 1 and machine 2.
3. List the jobs in order of increasing processing time on machine 1.
4. List the jobs in order of decreasing processing time on machine 2.
5. Merge the two lists by selecting the job with the smallest processing time on either machine.
6. Assign the jobs to the machines based on the order of the merged list.
7. Compute the idle time on both machines.
8. Repeat steps 5-7 until all jobs have been assigned.
Why Johnson's Algorithm Minimizes Idle Time:
Johnson's algorithm minimizes idle time because it prioritizes jobs that have the shortest processing time on either machine. By selecting jobs in this way, the algorithm minimizes the time that either machine is idle, which in turn reduces the overall idle time for the system. This approach is more effective than other scheduling rules such as SPT, EDD, or critical ratio rule, which do not take into account the processing time on both machines.
Johnson's algorithm is an efficient way to minimize the idle time of an n-jobs and 2 machine problem. The algorithm is used to schedule jobs on two machines, such that the idle time on both machines is minimized. It is a greedy algorithm that works by selecting the job with the smallest processing time on either machine.
Steps of Johnson's Algorithm:
1. Transform the n-jobs and 2 machine problem into a modified 3-machine problem by adding a dummy machine with processing time 0 for each job.
2. Determine the processing time of each job on machine 1 and machine 2.
3. List the jobs in order of increasing processing time on machine 1.
4. List the jobs in order of decreasing processing time on machine 2.
5. Merge the two lists by selecting the job with the smallest processing time on either machine.
6. Assign the jobs to the machines based on the order of the merged list.
7. Compute the idle time on both machines.
8. Repeat steps 5-7 until all jobs have been assigned.
Why Johnson's Algorithm Minimizes Idle Time:
Johnson's algorithm minimizes idle time because it prioritizes jobs that have the shortest processing time on either machine. By selecting jobs in this way, the algorithm minimizes the time that either machine is idle, which in turn reduces the overall idle time for the system. This approach is more effective than other scheduling rules such as SPT, EDD, or critical ratio rule, which do not take into account the processing time on both machines.
Free Test
FREE
| Start Free Test |
Community Answer
Which of the following minimizes the idle time of an n-jobs and 2 mac...
Spt - min inventory cost
edd- minimum tardiness
critical ratio - % of completion of project
Johnson's alogo- optimum job sequence and minimum make spam reducing ideal time
edd- minimum tardiness
critical ratio - % of completion of project
Johnson's alogo- optimum job sequence and minimum make spam reducing ideal time
|
Explore Courses for Mechanical Engineering exam
|
|
Similar Mechanical Engineering Doubts
Top Courses for Mechanical EngineeringView all
Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer?
Question Description
Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer? for Mechanical Engineering 2025 is part of Mechanical Engineering preparation. The Question and answers have been prepared according to the Mechanical Engineering exam syllabus. Information about Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for Mechanical Engineering 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer?.
Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer? for Mechanical Engineering 2025 is part of Mechanical Engineering preparation. The Question and answers have been prepared according to the Mechanical Engineering exam syllabus. Information about Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for Mechanical Engineering 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer?.
Solutions for Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Mechanical Engineering.
Download more important topics, notes, lectures and mock test series for Mechanical Engineering Exam by signing up for free.
Here you can find the meaning of Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer?, a detailed solution for Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer? has been provided alongside types of Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Which of the following minimizes the idle time of an n-jobs and 2 machine problem?a) SPT ruleb) Johnson’s algorithmc) EDD ruled) Critical ratio ruleCorrect answer is option 'B'. Can you explain this answer? tests, examples and also practice Mechanical Engineering tests.
|
|
Explore Courses for Mechanical Engineering exam
|
|
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup