How to implement an airplane luggage accomodation algorithm for schedule generation?
Yes, you could modify an airplane luggage accommodation algorithm into a school scheduling algorithm. The “minimum space possible” problem you refer to is probably the knapsack problem, whose goal is to get as much stuff of varying sizes as possible into a small space. The knapsack problem is NP-Complete, which fortunately means that we can reduce it to any other NP-Complete problem, which indirectly means that we can certainly reduce your problem to this problem, as long as it is maximally NP-Complete difficult, and I’m willing to take on faith that it is. Yay, I’ve proved that it can be done without actually doing it! This doesn’t actually explain how to do it, though. To do that we need to carefully define both problems. The knapsack problem is well-defined, but the school timetable algorithm is not, and so I cannot answer your question. You’d have to enlighten me on what exactly your timetable generator does and what sort of bounds it’s working within. Generally, there are some est
