Nothing to say, yet
Transcription
The speaker is discussing topics related to industrial engineering, specifically inventory, power CPM, forecasting, and linear programming. They mention that linear programming is an important topic and that they are unsure about the new chapters on reliability and failure analysis. They talk about their study strategy, mentioning the importance of studying break-even analysis, inventory, sequencing, power CPM, forecasting, line balancing, queuing theory, and linear programming. They mention having filled up a notebook and starting with studying spurt and CPM. They discuss the components of spurt and CPM, such as project, event, activity, network diagrams, and the differences between spurt and CPM. They mention the need to understand beta distribution for activities and normal distribution for the project. They talk about critical path, probability of completing the project on time, forward and backward path computation, slacks, floats, and the time cost method. They mention crushing, now hello everyone so today let me start with this industrial engineering four questions comes from industrial engineering and which of which all are they so this inventory is there, power cpm is there, forecasting is there then linear programming is there okay so 70% chance of their name in linear programming will have one question and new chapters which were added were reliability and failure analysis I don't know much about them okay simple are there but just I will revise it okay planning and plan layout okay notes no no not that much important as far as I know so what is important is inventory, power cpm, forecasting, linear programming how I will be studying how my notes are according to first of the break-even analysis then inventory then this is sequencing thing how what sequence we put items in okay machines what sequence we should be putting in what jobs what sequence we are putting in all that then power cpm will be coming but power cpm is fourth chapter if we make inventory second okay and then forecasting is there okay after forecasting line balancing queuing theory line balancing okay line balancing is there then queuing theory is there then comes to the linear programming okay so only this much is there and full notebook is filled up okay so I start with this spurt and cpm so in this spurt and cpm so what is there in this spurt and cpm so what is there in this spurt and cpm is that first of all what is project what is an event what is a what is an activity then what are the network diagrams okay network diagram can be of two types we want events on node or activity on node what we want to that is different thing and then rules for network construction then we have to construct a network then types of network that is what I talked then we see what is spurt what is cpm and what are the differences between them the first thing is that we must be able to make this network diagram if we are able to make the network diagram and choosing the right network diagram events on node or activity on node accordingly we can have this for spurt and cpm so what is spurt and in spurt the optimistic time pessimistic time and most likely time all that we have to see now comes the question activity will have beta distribution and project will have normal distribution this needs to be revised and this is the thing which needs to be taken care of I will write this is okay I got it I need to make notes so that I can write is that activity is having beta distribution so if this is time this is probability and beta distribution and activity will have beta distribution activity has beta distribution whereas the project itself the project and normal distribution and this is the this is activity okay and I'm going on to the next one this is okay next is okay this time so there's invariances that then what is the critical path probability of completing project within scheduled time what is the scheduled time how it is the probability and all that and then I come up to forward path computation backward path computation what do we compute is this at least time latest time for the event head event tail event and all that slacks we have to see and head events like tail events like critical path method then critical path method will come then slack and float two things will be coming up so total float total three kind of floats are there free float independent float total float so what are all this we need to know and then crushing or time cost method this crushing what is direct cost what is indirect cost and then what is the total cost and how do we calculate that's all and there's a simple route critical path select the critical in critical path select the critical activity having minimum cost slope okay whichever is having minimum cost look what is cost of rupees per day which cost minimum reduce the duration of this activity by one time unit revise the network diagram and like that now the network is three critical path and all that so that is all I need to go through pert and CPM
