X-Received: by 10.42.118.200 with SMTP id y8mr11800369icq.4.1408822857572; Sat, 23 Aug 2014 12:40:57 -0700 (PDT)
X-Received: by 10.50.153.77 with SMTP id ve13mr140203igb.16.1408822857467; Sat, 23 Aug 2014 12:40:57 -0700 (PDT)
Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!r2no5784633igi.0!news-out.google.com!aw9ni2igc.0!nntp.google.com!r2no5784632igi.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.games.development.programming.algorithms
Date: Sat, 23 Aug 2014 12:40:56 -0700 (PDT)
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=175.136.6.48; posting-account=vmr7jAoAAACbWm_e9LbYHPBXWj9cYRAn
NNTP-Posting-Host: 175.136.6.48
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <5c01f843-4b79-465c-b8f5-21f74c6bdd2c@googlegroups.com>
Subject: What is the suitable genetic or optimization algorithm for scheduling problem in industrial training system?
From: Navhin Nair <navhin.nair@gmail.com>
Injection-Date: Sat, 23 Aug 2014 19:40:57 +0000
Content-Type: text/plain; charset=ISO-8859-1
Xref: csiph.com comp.games.development.programming.algorithms:55

My research project is finding suitable algorithms to be used in industrial training system for the below constrain: 

1) The system should allocate equal amount of students to the lecturer for the supervision purpose. Example, if there is 500 students who going for industrial training and 20 lecturers available, so each lecturer should get 25 students equally. 


2) The system should allocate the students according to the students working place address and lecturers address which is lecturers will provide max 3 address. So the system must find the lecturer who near to students working place. 



What type of scheduling or allocation algorithms i can use to solve the above problem. Please help me out