Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!ub!sarnath
From: sarnath@sybil.cs.Buffalo.EDU (Ramnath Sarnath)
Newsgroups: comp.theory
Subject: Polynomial time scheduling algos.
Message-ID: <70425@eerie.acsu.Buffalo.EDU>
Date: 11 Apr 91 19:38:13 GMT
Sender: news@acsu.Buffalo.EDU
Organization: State University of New York at Buffalo/Comp Sci
Lines: 7
Nntp-Posting-Host: sybil.cs.buffalo.edu
Originator: sarnath@sybil.cs.Buffalo.EDU


I am looking for restricted versions of multi-processor scheduling
problems that are known to be solvable in polynomial time.

I would appreciate any references to such work.

sarnath