MANAGEMENT SCIENCE UNIT-2 JOB PROCESSING | Degree 4th sem bba management science unit-2

Añadido: 2026-05-30

[00:00:00]Hello dear students, welcome back to our YouTube channel Learn with Sahira. In this video, we are going to see the complete and clear explanation of unit number two, job processing, from the subject of management science, which is for degree fourth semester BBA students.

[00:00:15]Definitely watch the video till the very end, and if you are new to our YouTube channel Learn with Sahira, subscribe it for more exam preparation videos.

[00:00:23]Students, because of shortage of time, I'm not explaining this method on board or any book. So, I suggest you to listen to me with full concentration, so that just by watching this one video, you will be perfect with this method, okay?

[00:00:38]Watch the video till the very end. Don't skip the video, okay? So, yeah, let us get started. Here we have our question.

[00:00:44]In unit number two, we have job processing, okay? We need to solve this method in our examination as well. They might be asking you the question in this way. In a factory, there are six jobs to perform, each of which should go through two machines, A and B, in order AB. Find the total elapsed time and idle time for each machine. So, here they have given us one box in which we are finding jobs, machine A, machine B, right? So, the moment you see this box, you have to count how many jobs are present. There are six jobs, right? So, once you find there are six jobs, you have to draw one row, and you have to divide it into six parts. 1 2 3 4 5 6. If you find there are 10 jobs, what you need to do? You need to take one row, and you have to divide it into 10 parts. 1 2 3 4 5 6 7 8 9 10. Like that, okay? How many jobs are there? That many parts you have to make.

[00:01:46]After that, after taking this part, okay? Like, after taking this row and dividing it in parts, you have to search for least number or smallest number from machine A and machine B. I'm showing you step by step. You have to follow these steps only. Okay, first take a row.

[00:02:05]Sorry, yeah, take a row and divide it into how many parts means how many jobs are present that many parts. After that check for least number from machine A and machine B. Now, least number from machine A and machine B, which is that number? It is one.

[00:02:22]Now, see where this one is. One is in machine B, right? If it is machine B, go from backward. If it is machine A, go from front. Okay, machine B have to be just a job. Machine A have to be just a job. One is the least method least number. Now, this one is present in which job? It is present in sixth job.

[00:02:43]So, we are taking six from backward.

[00:02:46]After one, which is the least number, guys? After one After one, it is two, right? Now, see two is present in A. So, definitely I'm not going to do anything. Two is present in which job? Three. So, just take three.

[00:03:02]Okay, six three done. After two, which is the smallest number? It is three.

[00:03:06]Three is in B, so we will go from backward. What is the job number? Job number is one. After three, which is the smallest number? It is four. But, four is present in machine A as well as machine B. So, what to do now? Take both the numbers, guys. Both the jobs.

[00:03:25]Find your happy little and two job here. You have to lay low.

[00:03:29]After four, what is the smallest number?

[00:03:31]It is five. Five is present in fourth job. So, we are taking this four. So, this is our optimal sequence or final sequence how you have to do. I hope you understood. Okay. So, this is our final output or your final sequence.

[00:03:47]Not doing it only in one row.

[00:03:51]Do it one by one. Okay, first take sixth job, then take third job, then like that first, second, like that you will be taking and finally this will be the sequence. After finding that sequence, you have to draw this table. In the table, you have sequence, machine A, machine B. In each machine you are having four columns. What are those four columns? Time in, processing time, time out, idle time. Time in, processing time, time out, idle time.

[00:04:23]Okay, this is start. This is finish.

[00:04:26]Okay, like that you have to take. And in this column of sequence, whatever the optimal or final sequence we got by obtaining smallest numbers and their jobs, you have to take that here in this sequence. 3 2 4 5 1 6, like that we have taken it. Right? Then, time in, processing time, time out, idle time. In four In these four columns, first we will be doing this processing time of two machines. Processing time is nothing but just go to your question and find in job three, which number is present in machine A? In job two, which number is present in machine A? Like that you have to find it. In job three, which number it is? It is two. Just take two here. In job two, which number is present? It is four. So, just take four here. In job four, which number is present? Job four me, it is five. Take five.

[00:05:25]In job five, which number is present?

[00:05:27]In job five, it is nine. So, what you are going to do? Nine. In job one, which number is present? It is seven. Okay, see, listen, we are not taking machine B values. We are just taking machine A values because we are working on machine A. Right? So, we are taken seven. In job six, which number is present? It is eight. So, we have taken eight here. How we have taken processing time of machine A in the same way take processing time of machine B as well.

[00:05:59]Job three, it is six.

[00:06:01]Right? So, just take six.

[00:06:05]Okay. Then after three, which one it is?

[00:06:08]Two. In job two, it is eight. So, just take eight. Like that, take all the values whatever it take. It is present in the question.

[00:06:19]After that, we will come to this time in processing time about we will come to this time in. Initially, we will start with zero for a machine A. Okay. Now, zero plus two, how much it will be? It will be two. So, we are taking two here.

[00:06:35]Now, two plus four, how much it is? It is six. We are taking six here.

[00:06:41]Six plus five, how much it is?

[00:06:45]11. We are taking 11.

[00:06:47]11 plus nine, it is 20. 20 plus seven, 27. Done. We are done with time in. We are just adding the values. I say I'm looking for add kind of add kind of we will be getting 27 as the last one. Now, how to take this time out? Add both of them. Okay. Till now, we were adding how we were adding? We were adding it in this way.

[00:07:12]Right?

[00:07:13]We were adding it in this way. But now, how to add? We should add it in this way.

[00:07:19]Okay. Zero plus two, two. Two plus four, six. Six plus five, 11. 11 plus nine, 20. 20 plus seven, 27.

[00:07:28]27 plus eight, 35. Like that, you have to add. Okay. We got time out. Now, idle time, how we will be getting?

[00:07:38]How we will be getting this idle time, guys? We need to minus in this way. Okay?

[00:07:45]I say you just same numbers and look minus gonna 2 minus 2 0 6 minus 6 0 11 minus 11 0 20 minus 20 0 27 minus 27 0.

[00:07:57]How to get this I will be explaining you. Don't worry. First let us see this machine B. Same here guys. What is the time out here? It is two right?

[00:08:07]So in time in I'm taking two. Time out of machine A time in for machine B.

[00:08:13]Please understand this. You have to pay that file you have to pay 10 you have to pay 10.

[00:08:19]Okay? So yes two. Now After this how we are going to do guys?

[00:08:27]Add.

[00:08:29]Just a minute.

[00:08:32]Yes guys.

[00:08:33]6 plus 2 8 8 plus 8 16 16 plus 6 22 22 plus 4 guys 22 plus 4 it is 26. By mistake he gave 27 but it is 26. Okay? 26 plus 3 27 28 29. So this is not 25 this is 29. So let me write it here. It is 26 and this is 29. I hope you understood. Now how to get this time out guys?

[00:09:07]Time out guys I'm look.

[00:09:10]Add again add.

[00:09:13]6 plus 2 8 8 plus 8 16 16 plus 6 22 22 plus 4 26 26 plus 3 29 29 plus 1 it is 30 like this. There is a mistake in the book but you have to correct it like that. Okay, idle time.

[00:09:33]How to get this idle time?

[00:09:35]8 minus 8 0 16 - 16 0 22 - 22 0 26 - 26 0 30 Sorry, 29 - 29 0. Now we are left with 30 here, 35 here. How to get this last one, guys?

[00:09:55]35 - 30 you do. Okay. Time out of machine A, time out of machine B. 35 - 30 how much it will be? It will be five.

[00:10:07]So here it will be five.

[00:10:09]Okay. After that what we are having?

[00:10:15]We are having this 29 time in of machine B, right? And time out of machine B.

[00:10:22]Time out you take, time in you take, you minus. What you will get? 30 - 29 how much it will be? It will be one. Okay, so here answer will be one. Idle time of machine A five, idle time of machine B is one. As simple as that. Okay?

[00:10:39]That's what it is. Now we also have one more question here as you can see on the screen. Please practice this question, okay? Here we are having 10 jobs, right?

[00:10:49]10 jobs are there. So how many parts you will be taking? You will be taking 10. 1 2 3 4 5 6 7 8 9 10. Okay, 10 parts. So now you check which one is the smallest number here.

[00:11:03]Smallest number you have here one here.

[00:11:06]One to near one to what you have here?

[00:11:08]Two here. Two is in J7. Two is in J2 as well.

[00:11:14]Okay.

[00:11:19]You will if machine two is there, go from back. Machine A or one is there, go from front, right? That's what we are going to do, right? So just take J7 then J2. J7 and J2 in this way. J7, J2.

[00:11:38]After two, which is the smallest number, guys? It is three. Where is three present? Three here it is. It is in machine one. So, go from front. J four.

[00:11:51]J4 like this front. You have to take like that. Already I have explained you, right? After that, we are having this time in processing time, time out, time idle time. This also same how we have done for previous one. You have to do it in that way only. One more question, guys. Like sometimes he might give you three machines. Okay, not two machines. He might give you three machines. Machine C also will be included. At that time, what you need to do? You need to take some random names of two machines. Okay?

[00:12:22]Let's say I want N1 N2. Okay, machine one and machine two was there. But, they have also added machine C with some values. Five, two, three, one, two, zero. Like that, they have added some Let us do it six. Like that, they have added. So, in this case, what you need to do? You have to take machine A and machine B. You have to add them. Machine A plus machine B. Then, you have to take machine B and machine C. You have to add it. Machine B plus machine C. Machine A plus machine B, you will get machine one equal to N1. Machine B plus machine C, you will be getting N2. Like that, you have to compress it. How you will be doing it? 7 plus 3 equal to what? 7 8 9 10. So, 10 will be the value of N1. N1 key first will be what? It will be 10. The jobs will be same.

[00:13:20]1 2 3 4 5 6. Jobs will be same.

[00:13:25]Okay, jobs will be same. Then, job one will be what? It will be 10. job one can you see I got 10 then Yeah, N2 N2 can you N2 3 + 5 3 + 5 how much it will be?

[00:13:40]8 Okay, next you do machine A plus machine B 4 + 8 Take it then 8 + 2 Take it below like that you have to compress it.

[00:13:51]In don't know add okay N1 N1 below Then machine C B 80 now machine B or machine C add N2 same process going on if you didn't understand definitely you will be getting it if you are having any doubts let me know in the comment section. You might face some difficulty while you are calculating the idle time.

[00:14:12]thing you need to find out I have said you right so yeah all the very best bye-bye.