Date: 03/30/05 (Algorithms)    Keywords: no keywords

I am trying to get a quick and dirty greedy method for solving the below job scheduling problem. I already developed a GA (genetic alg) version of it so want to compare between the 2 and probably can use the greedy one as a local optimization. Any one has any idea for the greedy algorithm ? Thanks,


This job (talk) scheduling is simpler than others, no different time length or penalties, each talk takes a fix-length time slot, users send in requests list, the only constraint is the schedule solution causes no conflict (i.e each user is able to attend all the talks he/she requested). Of course the goal is to minimze the number of different time slots.

Source: http://www.livejournal.com/community/algorithms/51301.html