[R] scheduling - algorithm solution or iterate?

From: SocialProgrammer <xeverin_at_yahoo.co.uk>
Date: Wed, 21 May 2008 04:59:04 -0700 (PDT)

Our final year students rank 5 classes (1st, 2nd, ..., 5th), and are allocated 3, based on their choices and a minimum class size. We want to maximise satisfaction (students getting their higher preferences), but have a minimum viable class size. Is there an algorithm out there to help, in R (like TSP for the travelling salesman prob) or elsewhere, or must I just iterate and locate the highest scoring ???

Thanks!

-- 
View this message in context: http://www.nabble.com/scheduling---algorithm-solution-or-iterate--tp17364154p17364154.html
Sent from the R help mailing list archive at Nabble.com.

______________________________________________
R-help_at_r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.
Received on Wed 21 May 2008 - 12:38:23 GMT

Archive maintained by Robert King, hosted by the discipline of statistics at the University of Newcastle, Australia.
Archive generated by hypermail 2.2.0, at Wed 21 May 2008 - 14:30:39 GMT.

Mailing list information is available at https://stat.ethz.ch/mailman/listinfo/r-help. Please read the posting guide before posting to the list.

list of date sections of archive