Joel Wein, Ph.D.
Associate Professor

Room: LC 230
Phone: 718.260.3376
Fax: 718.260.3609
E-mail: wein@mem.poly.edu
Website: http://ebbets.poly.edu/PDC-lab/wein.html

Interest

• Scheduling
• Parallel and distributed computing
• Combinatorial optimization
• Data mining, algorithms

Profile

Joel Wein received the B.A. degree from Harvard University in 1985 and the Ph.D. from MIT in 1991. While at MIT he was a part-time employee of Thinking Machines Corporation, where he wrote some of the first papers about the use of massively parallel computers to solve network optimization problems. He is interested in a wide range of problems in parallel and distributed computing, combinatorial optimization and communications network design. His research is supported by grants from the National Science Foundation and the Center for Advanced Technology in Telecommunications, and he has published papers on both theoretical and practical problems in parallel computing, network optimization, and scheduling theory. Dr. Wein enjoys teaching freshman computer science and advanced graduate courses in theoretical computer science and parallel computing.

Selected Publications

• "Scheduling To Minimize Average Completion Time: Off-line and On-line Approximation Algorithms,'' with Leslie A. Hall, Andreas Schulz and David B. Shmoys. Mathematics of Operations Research, August 1997.
• "Scheduling Parallel Machines On-line", with David Shmoys and David Williamson. SIAM Journal of Computing, December 1995, 24:1313--1331.
• "On the Massively Parallel Solution of the Assignment Problem", with Stavros Zenios. The Journal of Parallel and Distributed Computing, October, 1991, pp. 228--237.
• Additional publications: http://ebbets.poly.edu/PDC-lab/wein.html

Ph D Student

• Rosell, Bard
• Uma, R.N.

Education

• Ph.D. Massachusetts Institute of Technology, 1991