First come first serve is used when there doesn't need to be prioritised instructions so whichever gets to the CPU first, it is executed without changing the order. Round Robin is used when the instructions need a fair share of CPU time, preventing it to be stuck on a instruction that takes much longer to execute than the others. However, if the time allocated is too small, all the switching between the different instructions can be inefficient. Shortest Remanining time hasn't got the best advantage as whislt the longer instructions don't block the shorter instructions, the opposite actually happens where longer instructions just end up not being executed if there are coninually short instructions. Shortest Job First also has a very similar issue to Shortest Remaining time so should only be used if there aren't certain instructions that are much longer than the other ones. Multi-level feedback queue is where different instructions are placed in different priority queues and have to wait differently based on their priority. This can be highly efficient but is complicated and difficult to manage.