最佳匹配调度算法 [英] 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.
很显然，我可以用蛮力，但这是很少的最佳解决方案。我猜这是一个比较基本的计算机科学问题，我将了解，一旦我能够开始服用的计算机科学课程。在此期间，我会preFER任何联系，我可以在这读了，甚至只是一个名字我可以谷歌。
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.
推荐答案
我认为你应该使用遗传算法，因为：
I think you should use genetic algorithm because:
- 这是最适合于大问题的实例。
- 在它产生的时间减少复杂度不准确答案的价格（不是最终的最好）
- 您可以指定约束和放大器; $ P $轻松pferences通过调整适应惩罚未满足的。
- 您可以对计划执行的指定时间限制。
-
溶液的质量取决于你有多少时间打算花解决方案。
- 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..
这篇关于最佳匹配调度算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
