个人日程规划师为学生 [英] personal schedule planner for students

问题描述

我正在开发一个基于控制台的个人日程规划师为学生。我的目标是，该应用将用户想要做以及可用与用于当天的用户的总时间什么活动，然后分配时隙，以表格的形式显示出来。

I am developing a console based personal schedule planner for students. My aim is that the app will take what activities the user wants to do along with the total time available with the user for the day, and then allot time slots and display them in tabular format .

alotted将取决于受试者（更多的时间分配用于更重要的任务等）的时间。

The time alotted will depend on the subject (more time allotted for more important tasks etc).

我在做这个项目我4'th学期ENG。

I am doing this project for my 4'th semester eng.

我已经开始工作的算法，我的问题是，任何这样的算法（已经）可用？我在网上搜索上，但规划的算法，我发现都是为了公交站牌等人，但我要找的。不正是

I have started working on the algorithm, my question is that, is any such algorithm (already) available? I searched on the web but the planning algorithms I found are all for bus schedule and others, but not exactly what I'm looking for.

推荐答案

所要求的艾米特，这里有一对夫妇的资源。

As requested by amit, here are a couple of resources.

背包问题是，据我了解，一个最大化问题。给定一组特定的用途和重量的物品，要选择最佳的子集 - 也就是说，对于一个给定重量的物品的最好的组合 - 你可以随身携带一个背包/背包最大容量

The Knapsack problem is, as far as I understand it, a maximisation problem. Given a set of items of particular usefulness and weight, you wish to select the optimum subset - that is, the 'best' combination of items for a given weight - the maximum capacity you can carry in a knapsack / rucksack.

例如，电锯可能是一个僵尸入侵一个非常有用的项目，但它是大而笨重，因此其实用性可能会被压倒，从字面上看，它的大头。而刀也是有用的，但重量少了很多。如果您选择的刀，你也可以选择火炬，撬棍，干粮和睡袋，而如果你选择的电锯您只需要空间的干粮。

For example, a chainsaw might be a very useful item in a Zombie invasion, but it is large and bulky, so its usefulness might be outweighed, literally, by its bulk. Whereas a knife is also useful, but weighs a lot less. If you select the knife, you can also select the torch, crowbar, dry rations and a sleeping bag, whereas if you select the chainsaw you only have space for the dry rations.

您的具体问题是试图以适应一组活动变成了固定时间段。要做到这一点，你需要权衡某些因素，如

Your particular problem is to attempt to fit a set of activities into a fixed time period. To do this you will need to weight the activities by certain factors, such as

• 在此期间，他们可以在一天中的时间
• 在其病程
• 在其可取的学生
• 它们是否可以被立即调度之前或类似活动后 - 为如如果一个学生刚刚去过健身房，他们不可能要参加游泳训练。

然后需要拿出加权算法，这些不同的因素，并使用加权算法来决定如何选择某一天的活动;记住，不同的人可能有不同的preferences，你将需要可能在你将使用权允许某种形式的可配置性。

You then need to come up with a weighting algorithm for these various factors, and use that weighting algorithm to decide how to select activities for a particular day; remembering that different people might have different preferences and you will need to likely permit some form of configurability in the weighting you'll use.

（请注意，这是所有假设的基础上我有限的接触到的算法 - 就像我说的，我从来没有做过我和上面再presents我如何，我会处理这个问题的第一个想法）。

(Please note that this is all hypothetical based on my limited exposure to the algorithm - as I said, I've never done it myself and the above represents my first thoughts on how I'd approach the problem).

我通过谷歌找到了一些资源： <一href="http://www.es.ele.tue.nl/education/5MC10/Solutions/knapsack.pdf">http://www.es.ele.tue.nl/education/5MC10/Solutions/knapsack.pdf

Some resources I found via google are: http://www.es.ele.tue.nl/education/5MC10/Solutions/knapsack.pdf

<一个href="http://mathworld.wolfram.com/KnapsackProblem.html">http://mathworld.wolfram.com/KnapsackProblem.html

<一个href="http://academicearth.org/lectures/knapsack-problem-1">http://academicearth.org/lectures/knapsack-problem-1 （麻省理工学院的演讲视频）

http://academicearth.org/lectures/knapsack-problem-1 (a MIT lecture video)

好运气，这听起来像一个有趣的项目。

good luck, it sounds like an interesting project.

这篇关于个人日程规划师为学生的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！