调度算法/问题 [英] Scheduling algorithm/problem

问题描述

我很无聊，而这个问题只是再缠着我。回到学校，我以前一直不知道他们是如何安排考试。能力安排10K学生做考试在2个星期，保证学生不会有连续两期考试。我假设某种形式的启发式的应用。

我很无聊今晚，如果你给我正确的工具，我今晚和后续工作就可以了周末

欢呼声， dassouki

修改1： 我猜的假设是我们所知道的是这样的：

1. 学生，他们是每一个参加的课程数
2. 在考试期间的斑点数

解决方案

这是一个著名的计算机科学问题（的考试调度问题），这被称为是 NP难。你可能不能够解决它在一个周末。

I'm bored, and this problem just haunted me again. Back at university, I used to always wonder how they schedule exams. The ability to schedule 10k student to do exams in 2 weeks and guarantee that no student will have an exam in two consecutive periods. I'm assuming some form of heuristics be applied.

I'm bored tonight, and if you give me the right tools, I'll work on it tonight and up to the weekend

cheers, dassouki

EDIT 1: I guess the assumption would be that all we know is the following:

1. Number of students and the courses that they're each enrolled in
2. Number of exam period spots

解决方案

This is a famous computer science problem (the exam scheduling problem) which is known to be NP-hard. You might not be able to solve it over a weekend.

这篇关于调度算法/问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！