Scheduling to Minimize Maximum Lateness ( Greedy Algorithm ) - Algorithms

[@aruneshsingh5698]

This is the best lecture i have seen on this topic

[@Amy-tw3zh]

I guess this is intuitive after all - we are going to start working on assignment whose deadline is the closest.

[@medoalnaser]

Thank you for putting this content on KZbin

[@mikycaballero1575]

gnj

[@Amy-tw3zh]

Also good to note that this is a "stay ahead" proof and not "exchange argument" proof.

[@Amy-tw3zh]

Analogy: I might get one of the assignments done today because its only gonna take me 1h, even though the deadline is so far away. Doing this, i will risk being too late on Assignment 2 which is due only 2 days from now! So It's better to do assignment 2 now so i minimize the time i'll be late for that assignment.

[@abdelhakelidrissi6881]

Dear, In the definition of the maximum lateness, you consider that: For all i, Li=max(0,Ci+pi) It's the definition of the tardiness not the definition of the lateness of a job. You must change maximum lateness by maximum tardiness, because lateness can be negative. Best,

[@MrACrazyHobo]

Best video on the topic.

[@mohamed.zarai25]

Thank you for this work, very useful for me in integrer programming

[@ruseruseruse]

"Imagine this: You are a student and you are a bit late on doing your assignments" hit me, lmao

[@leetchef6602]

great work

[@soumyasen1483]

When we convert the equality l'_m = f_n - d_m to an inequality, shouldn't it be a < instead of a f_m - d_m, so shouldn't it be l'_m < f_n - d_n, and not l'_m

[@capturedart0]

where is the actual code?

[@MiguelRamirez-rk4wk]

"This shouldn't be too hard to imagine" lmaooo

[@arianj2863]

Your proof seems to be incomplete right? You're only considering the case where we have adjacent inversions, what if we have non-adjacent inversions though? I feel as if there is some way to proof that whenever we have an inversion, we also have an adjacent inversion, but I'm not sure. EDIT: I just realised that you can achieve an array sorted by deadlines using just adjacent inversions, just like how it goes in insertion sort.

[@scholli99]

nice fake english accent xd