On Mon, 2013-09-09 at 23:07 +0100, D Perrett wrote:
> I suspect this is the sort of problem where no solution will give you
> consistently unremarkable results if in the long run there are any
> unspoken requirements like 'students shouldn't be able to game the
> system by lying about their prefere
Sent from my iPhone
On 10 Sep 2013, at 08:50, Raphael Mankin wrote:
> This approach has exponential complexity. Definitely infeasible.
Not necessarily. How many courses are there Dave?
James
Quoting James Laver :
Sent from my iPhone
On 10 Sep 2013, at 08:50, Raphael Mankin wrote:
This approach has exponential complexity. Definitely infeasible.
Not necessarily. How many courses are there Dave?
About 30.
Dave...
Quoting Dave Cross :
I have offered to help a friend[1] solve what sounds like an
interesting problem.
[ snip ]
Thanks for all the suggestions.
It turned out that I only had two or three hours to do this, so I
didn't have time to research any of the algorithms that you mentioned.
So I t
> Although it's not a complete solution, it's enough of an improvement on the
> old (manual) process that they are really happy.
that sounds for the best solution to me.
Course and class scheduling software is out there... and so far those companies
haven't found 'the solution'
> I'll carry o
You can reduce the problem domain a bit:
For classes that can accept an infinite number of students, start by
assigning all students whose 1st choice it is. It's not going to limit
other student's choices, so it's all positive.
For classes that don't have anyone who took it as 1st choice, assign
Arg, too late.
Each student goes to 2 classes then? That would mean that you can assign to
"infinite size" classes all students who chose it as 1st or 2nd choice.
That should reduce the problem domain quite a bit.
On Tue, Sep 10, 2013 at 09:59:01AM +0100, Pierre M wrote:
>
> I have an idea of a suboptimal "lazy" (in terms of computation) strategy,
> but i'm lazy to write it right now.
And it would be too large to fit in the margin anyway.
--
Philippe Bruhat (BooK)
One lesson learned is never enough.
Quoting Pierre M :
Arg, too late.
Each student goes to 2 classes then? That would mean that you can assign to
"infinite size" classes all students who chose it as 1st or 2nd choice.
That should reduce the problem domain quite a bit.
But (as I suspected), infinite classes quickly become "oh, w
On Tue, Sep 10, 2013 at 08:29:05AM +, Dave Cross wrote:
> Quoting Dave Cross :
>
>> I have offered to help a friend[1] solve what sounds like an
>> interesting problem.
>
> [ snip ]
>
> Thanks for all the suggestions.
>
> It turned out that I only had two or three hours to do this, so I didn'
Are there classes that are "close" to each other in a content sense that
would make a good fallback?
On Tue, Sep 10, 2013 at 9:15 AM, Dave Cross wrote:
> Quoting Pierre M :
>
> Arg, too late.
>>
>> Each student goes to 2 classes then? That would mean that you can assign
>> to
>> "infinite size
On Tue, Sep 10, 2013 at 9:19 AM, Dave Cross wrote:
>> Not necessarily. How many courses are there Dave?
>
>
> About 30.
Sorry, that was in the original email. I meant to ask how many students.
James
On Tue, Sep 10, 2013 at 11:24:10AM +0200, Abigail wrote:
>
> There's also the lazy solution: randomly assign students to classes.
> Tell them they're allowed to make any change they want, provided
> that: 1) it gets a buy-in from any student involved in the change,
> and 2) no class exceeds the ma
Quoting James Laver :
On Tue, Sep 10, 2013 at 9:19 AM, Dave Cross wrote:
Not necessarily. How many courses are there Dave?
About 30.
Sorry, that was in the original email. I meant to ask how many students.
387.
On Tue, Sep 10, 2013 at 11:42:25AM +0200, Philippe Bruhat (BooK) wrote:
> On Tue, Sep 10, 2013 at 11:24:10AM +0200, Abigail wrote:
> >
> > There's also the lazy solution: randomly assign students to classes.
> > Tell them they're allowed to make any change they want, provided
> > that: 1) it gets
On this website there's a free (gnu) application to do this (they call it
"student sectioning", and it also takes into account the fact that there's
timetable conflicts) : http://www.unitime.org/sct_description.php
They published this article to explain their approach and compare it to
others:
htt
On Tue, Sep 10, 2013 at 11:18:47AM +0100, Nicholas Clark wrote:
> On Tue, Sep 10, 2013 at 11:42:25AM +0200, Philippe Bruhat (BooK) wrote:
> >
> > I'd say it's more of a distributed solution, since the work is distributed
> > over the computing power of the students. It also has the nice benefit
>
On Tue, Sep 10, 2013 at 11:18:47AM +0100, Nicholas Clark wrote:
> On Tue, Sep 10, 2013 at 11:42:25AM +0200, Philippe Bruhat (BooK) wrote:
> > On Tue, Sep 10, 2013 at 11:24:10AM +0200, Abigail wrote:
> > >
> > > There's also the lazy solution: randomly assign students to classes.
> > > Tell them th
On Tue, Sep 10, 2013 at 11:27 AM, Philippe Bruhat (BooK)
wrote:
>
> OTOH, it might improve the network connectivity.
And valuable (IRL) social networking opportunities.
James
Feeling less lazy now. If you decided to still implement something
yourself, here is a non-optimal algorithm whose first aim is to assign all
students, so that teachers don't have to do it manually. It should reach a
first (suboptimal) solution very fast, and enable further optimization if
you want
On Tue, Sep 10, 2013 at 11:24:10AM +0200, Abigail wrote:
> There's also the lazy solution: randomly assign students to classes.
> Tell them they're allowed to make any change they want, provided
> that: 1) it gets a buy-in from any student involved in the change,
> and 2) no class exceeds the max
Searching in Google Scolar, i see that there is no "one solution" there,
but quite a lot of research. The best solution is probably to use an
existing product.
I just had a tooth filling, it hurts, playing with this problem kept me
busy.
On Tue, Sep 10, 2013 at 11:41:23AM +0100, James Laver wrote:
> On Tue, Sep 10, 2013 at 11:27 AM, Philippe Bruhat (BooK)
> wrote:
> > OTOH, it might improve the network connectivity.
> And valuable (IRL) social networking opportunities.
Why not just have a sealed-bid auction where students buy a
Motivated by the dual reasons of Jay Rayner having finally discovered their
xiao long bao and writing about them in tones that made me crave them from when
I used to do them regularly and a strong desire to avoid a particular client
meeting I don't want to be in, let's have dim sum tomorrow - it
24 matches
Mail list logo
