[Santa-rosa-pm] The guy who is trying to do the np-complete problem

[William Heath]

Hi All,

I just wanted to say how much I appreciated all the help I received last
night on my job shop scheduling heuristics analysis.  Some people were
interested in seeing the code as I have written it so far to solve this
problem using a greedy algorithm as Tom Anderson put it.  You can download
the code at:

http://edusmart.cvs.sourceforge.net/edusmart/perlMRPScheduler/

Let me know your suggestions!

Thanks,

Tim

P.S.

I am working on getting my jifty stuff ready for you all to look at.  The
test client for my scheduler creates the 6000 jobs that have to be scheduled
in 30 seconds and you can see it fail.  (I thought it was 30,000, but it is
just 6000)  I also can't wait to try Tom's genetic algorithm approach!  Also
as you can see this code is hosted on my sourceforge account so the cvs
works if you want access let me know.  You can always download the code
anonymously.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mail.pm.org/pipermail/santa-rosa-pm/attachments/20060927/c5aa9b0e/attachment.html