Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!hellgate.utah.edu!caen!zaphod.mps.ohio-state.edu!think.com!linus!linus!chance.mitre.org!tomg
From: tomg@chance.mitre.org (Tom Gerasch)
Newsgroups: comp.theory
Subject: parallel scheduling algorithms
Message-ID: <1991Feb1.183318.19374@linus.mitre.org>
Date: 1 Feb 91 18:33:18 GMT
Sender: news@linus.mitre.org (News Service)
Distribution: comp.theory,comp.parallel
Organization: The MITRE Corporation, McLean, VA
Lines: 17
Nntp-Posting-Host: chance.mitre.org

I am interested in references that exist for parallel scheduling algorithms.
The kinds of scheduling I am most interested in are multiprocessor scheduling
and jobshop scheduling.  I am interested in asymptotic behavior of algorithms,
actual execution time for implementations on parallel machines, and, since
most algorithms in these categories will probably not provide optimal 
solutions, theoretical or statistical analyses of the results.

Any information will be greatly appreciated.

Thanks in advance


-- 
Dr. Tom Gerasch, Lead Scientist      DDN: tgerasch@mitre.org 
MITRE Software Engineering Center 	  tomg@mitre.org
7525 Colshire Drive		     (703) 883-7895	
McLean, VA  22102-3481