StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
13258093
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-11-06T19:35:20.447
FavoriteCount
0
LastActivityDate
2012-11-06T19:35:20.447
LastEditDate
LastEditorUserId
0
OwnerUserId
938695
ParentId
13257826
PostTypeId
2
Score
11
ViewCount
0
LastEditorDisplayName
text
Body
Scheduling is a very famous <a href="http://en.wikipedia.org/wiki/Constraint_satisfaction_problem">constraint satisfaction problem</a> that is generally <a href="http://en.wikipedia.org/wiki/NP-complete">NP-Complete</a>. A lot of work has been done on the subject, even in the same context as you: <a href="http://www.aloul.net/Papers/faloul_sch_gcc07.pdf">Solving the University Class Scheduling Problem Using Advanced ILP Techniques</a>. There are even <a href="http://books.google.com/books/about/Planning_Scheduling_And_Constraint_Satis.html?id=gmN57JsdvjUC">textbooks</a> on the subject. People have taken many approaches, including: <ul> <li><a href="http://en.wikipedia.org/wiki/Dynamic_programming">Dynamic programming</a></li> <li><a href="http://en.wikipedia.org/wiki/Genetic_algorithm">Genetic algorithms</a></li> <li><a href="http://en.wikipedia.org/wiki/Artificial_neural_network">Neural networks</a></li> </ul> You need to reduce your problem-space and complexity. Make as many assumptions as possible (max amount of classes, block based timing, ect). There is no silver bullet for this problem but it should be possible to find a near-optimal solution. Some semi-recent publications: <ul> <li><a href="http://dl.acm.org/citation.cfm?id=1099435.1099503&coll=DL&dl=GUIDE&CFID=194497662&CFTOKEN=57250293">QUICK scheduler a time-saving tool for scheduling class sections</a></li> <li><a href="http://dl.acm.org/citation.cfm?id=360387.360403&coll=DL&dl=GUIDE&CFID=194497662&CFTOKEN=57250293">Scheduling classes on a College Campus</a></li> </ul>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POEfficient scheduling of university courses
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USAustin Henley
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.