Session 24 Scheduling II

1:30 PM-2:50 PM
Room: Liberty B
Chair: Cindy Phillips, Sandia National Laboratories

1:30-1:47 Linear-time Approximation Schemes for Scheduling Malleable Parallel Tasks

Klaus Jansen, IDSIA-Lugano, Switzerland; and Lorant Porkolab, Max-Planck Institute for Computer Science, Saarbrücken, Germany
1:50-2:07 Randomized Online Scheduling on Two Uniform Machines: Leah Epstein, Tel-Aviv University, Israel; John Noga, University of California, Riverside; Steve Seiden, Technische Universität Graz, Austria; Jiri Sgall, Charles University, Prague, Czech Republic; and Gerhard Woeginger, Technische Universität Graz, Austria
2:10-2:27 Preemptive Scheduling with Job-Dependent Setup Times: Petra Schuurman, Eindhoven University of Technology, The Netherlands; and Gerhard J. Woeginger, Technische Universität Graz, Austria
2:30-2:47 Approximability of Scheduling with Fixed Jobs: Mark Scharbrodt and Horst Weisser, Technische Universität München, Weihenstephan; and Angelika Steger, Technische Universität München, Germany

tjf, 9/12/98, MMD, 10/16/98