Відео

how we get that delta 1 and delta 2

Thank you

Nice Lec Sir

Sir, the discussion is best.

Sir ? How to solve GRG manually like LPP using pen and notebook

Excuse me Sir, are you have a video for flow shop heuristic Gupta Method? Or book? I need it to finish my college task. Im very interested that u can explain about Nawaz glow shop scheduling but i need one Method again that is Gupta Heuristic🙏

The book name u follow

Not all heroes wear capes, this video is an example

Thanks 😊 sir

GODLEVEL TEACHING

How to tune the SA if i have any constraints in the problem?

Thank you so much. Now I will try to implement it in C++ Builder.

tq sir

Hope, you found it worth watching

all this stuff is used in pattern recognition and machine learning.

great lecture

thanks for this lectures

Dear Professor, thank you very much for the great lecture over GRGM with clear examples. I would like to ask which variant of GRGM is the one you explain on this video?

thanks sir you help me for solve my problem, thanks again from Indonesian Engineering Student

Thank you sir for understanding step wise😊

Sir can you give me your channel plz

Thank you for the lecture sir

Thank you for this presentation sir. My question is if after eliminating the first tardy job and eliminating the job with longest processing time and there are still tardy jobs. To continue with the process, do I have to identify and eliminate first tardy job first or to eliminate the job with longest processing time sir?

Thank you so much, Prof, for the clear explanation. I sincerely appreciate it. Please sir, what are the termination criteria for newton's method?

Sir can you suggest if the jobs can be completed on single machine itself i.e., it need not to go to different machine. And we have N jobs and M machines, objective is to assign all jobs to their compatible machines in such a way that total run time of each machine is minimum. Then which approach has to be followed?

Sir Can You solve below Problem Please: Consider a state space having 3 states: s1, s2 and s3. The value of each state is V(s1) = 0, V(s2) = 4, V(s3) = 2. There can be transitions from s1 to s2, s2 to s1 and s3, and s3 to s2. Starting at s1, what is the probability that we end up back at s1 after 2 steps of simulated annealing? Assume that we follow a temperature schedule of [10, 5, 1].Next state is chosen uniformly at random whenever there are multiple possibilities. Round answer to 3 digits after decimal point.

How to open optimisation tool?

Sir at 4 step at 14:26 € is still < L (v-u) why did u terminate it

what a grt explmation sir

Extremely nice explanation of GA. Highly recommended and thank you Professor!

Dear Sir, your SA lectures are insightful. I have one query though. Suppose we have 3 variable optimisation problem. So we will be required to find z3 and hence x3 also. In such a case, how to find out z3. Box-Meuller transformation will give us only z1 and z2.

In-depth explanation by Professor. Thank you!

Thank you sir... Having started with the 1st lecture, I finally completed the GA today... It took over 1 month... It was fun learning from you...

sir plese uolod ppt

Thanks, sir for this wonderful opening lecture... Hope this start ends in the completion of the lectures and the subsequent completion of my research.

Thank you Sir for the lectures

thank you very much sir, I follw you from algeria. I need a help about hybrid protocol FA and SA algorithms.

Thanks, sir

Sir is there pdf available for this series

I think there is a mistake at the completion time table, 32+6=36? Not 38?

Thanks for your explanation sir, this is really useful for me. Please share the Matlab code for this method.

Sir discuas quadratic interpolation method also

A part of my headache is over. UA-camrs explaining better than my professors is still a better story than twilight

thanks sir

Dear Prof Saroj Kumar Patel! I am M Nawaz of the author of the paper that proposed the heuristic now simply called NEH algorithm. How can I contact you?

Sir, any example of Matrix under crossover types?

Thanks for the explanation.

If we fixed job 1 and job 3 has the earliest due date but it has a release date bigger than completion time of the first fixed job do we fix job 2 (because it is available ) for processing until we reach the release date of job 3 or we just fix job 3 because it has the earliest due date

thanks for the explanation.

thanks for the explanation.