Session 36 Scheduling IV

9:00 AM-10:40 AM
Room: Liberty B
Chair: Cindy Phillips, Sandia National Laboratories

9:00-9:17 Optimal Scheduling of Multiclass Parallel Machines

Jay Sethuraman, Massachusetts Institute of Technology; and Mark S. Squillante, IBM T. J. Watson Research Center
9:20-9:37 Algorithms for Total Weighted Completion Time Scheduling: Ivan D. Baev and Waleed M. Meleis, Northeastern University; and Alexandre Eichenberger, North Carolina State University
9:40-9:57 On Minimum Sum Multi-Coloring of Graphs: Bar-Noy, Tel-Aviv University, Israel; M. M. Halldorsson, University of Iceland, Reykjavik, Iceland; G. Kortsarz, Open University, Ramat Aviv, Israel; R. Salman and H. Shachnai, Technion-Insrael Institute of Technology, Haifa, Israel
10:00-10:17 Improved Bicriteria Existence Theorems for Scheduling: Javed Aslam, April Rasala, Cliff Stein, and Neal Young, Dartmouth College
10:20-10:37 On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem: Artur Czumaj, University of Paderborn, Germany; and Andrzej Lingas, Lund University, Sweden

tjf, 9/14/98, MMD, 11/2/98