Newsgroups: comp.parallel
From: jmina@ndu.edu.lb
Subject: Task assignement and scheduling in parallel and distributed systems
Organization: Deja News - The Leader in Internet Discussion
Date: 24 Mar 1998 01:37:14 GMT
Message-ID: <6f72oa$ljh$1@encore.ece.cmu.edu>

Dear sirs,

I master student at Notre Dame University - Lebanon. I am working on a
master's thesis concerning the task assignement and scheduling in
parallel and distributed systems. I am interested in any new research
related to this topic available on electronic media.  Furthermore, I
am desperately in need of a very old paper published in 1974 which it
can't be found in Lebanese universities as printed material. So, I
would be very grateful if I can receive this article in Adobe Acrobat
or any electronic media form. 

The article is :
Characterization and theoratical comparaison of branch-and-bound
algorithms for permutation problems.
By W.H.Koheler
J. Ass. Comput. Mach.
Vol. 21, pp. 140-156, Jan 1974

Thank you in advance.

Johnny Mina
Notre Dame University
Po.Box. 72 Zouk Mikael
Beirut - Lebanon

--
Articles to parallel@ctc.com (Administrative: bigrigg@cs.cmu.edu)
Archive: http://www.hensa.ac.uk/parallel/internet/usenet/comp.parallel