🚀 go-pugleaf

Thus spake wright@lims01.lerc.nasa.gov (Ted Wright):

>Thanks to Dave Schaffer and everyone else that responded:

	[extensive bibliography deleted]

Another important (IMHO) GA paper that gives a scheduling application
is the following poorly-titled article:

	"New search spaces for sequencing problems with applications
	 to job shop scheduling"
	R. Storer, D. Wu, and R. Vaccari (Lehigh University)
	_Management_Science_ volume 38 #10, October 1992

This paper was one of the first to introduce (independently) the idea of
encoding a solution as a data/heuristic pair, rather than explicitly as a
solution.  In particular, schedules in a job shop are encoded as fake sets
of processing times and due dates, to which a naive constructive heuristic
is then applied.  This saves the hassle of representing the fine structure
of the resulting schedule in the encoding.


-- 
       David Tate        |"Something there is that doesn't love a wall,
 dtate@unix.cis.pitt.edu | That sends the screaming liner over it 
 Prof. of Story Problems | And spills the bleacher-dwellers from their seats."
 Member ORSA, TIMS, SABR |  	"Fenway Wall", Robert Frost