Newsgroups: comp.ai.alife
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!europa.chnt.gtegsc.com!news.sprintlink.net!pipex!warwick!news.dcs.warwick.ac.uk!not-for-mail
From: Martyn.Amos@dcs.warwick.ac.uk (Martyn Amos)
Subject: Re: Using GAs to solve scheduling problems
Message-ID: <1995May14.185249.17290@dcs.warwick.ac.uk>
Sender: news@dcs.warwick.ac.uk (Network News)
Nntp-Posting-Host: pyrites
Organization: Department of Computer Science, Warwick University, England
References: <3p004b$39r@jac.zko.dec.com>
Date: Sun, 14 May 1995 18:52:49 GMT
Lines: 20

In article <3p004b$39r@jac.zko.dec.com> feingold@avette.zko.dec.com (Elan Feingold) writes:
>
>Hi, 
>
>I'm looking for pointers to papers, source code, etc., that solve
>the problem stated in the subject; i.e. given m resources, n tasks, 
>and p contraints, obtain an "good" schedule.

Have a look at Jane Shaw's scheduling page at

	http://www.shef.ac.uk/uni/union/susoc/cass/homes/misc/shaw/gas4sch.html

Regards,

Martyn
-- 
Martyn Amos = martyn@dcs.warwick.ac.uk =  Parallel Computation Group, Dept.
=-=-=-=-=-= = martyn@alife.santafe.edu =  of Computer Science, University of
-=-=-=-=-=- =   (Santa Fe Institute)   =  Warwick, Coventry, CV4 7AL, UK
------------         http://www.dcs.warwick.ac.uk/~martyn/       ------------
