Best Fit Scheduling Algorithm
I'm writing a scheduling program with a difficult programming problem. There are several events, each with multiple meeting times. I need to find an arrangement of meeting times such that each schedule contains any given event exactly once, using one of each event's multiple meeting times.
Obviously I could use brute force, but that's rarely the best solution. I'm guessing this is a relatively basic computer science problem, which I'll learn about once I am able to start taking computer science classes. In the meantime, I'd prefer any links where I could read up on this, or even just a name I could Google.
Answer
I think you should use genetic algorithm because:
- It is best suited for large problem instances.
- It yields reduced time complexity on the price of inaccurate answer(Not the ultimate best)
- You can specify constraints & preferences easily by adjusting fitness punishments for not met ones.
- You can specify time limit for program execution.
The quality of solution depends on how much time you intend to spend solving the program..