Tuesday, January 7
8:30 AM-10:05 PM
Orleans-Rosalie-St. Claude
Chair: Avrim Blum, Carnegie-Mellon University

Session 18

8:30-8:50 Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
Fabian A. Chudak and David B. Shmoys, Cornell University
8:55-9:15 Improved Approximation Algorithms for Scheduling with Release Dates
Michel X. Goemans, Massachusetts Institute of Technology
9:20-9:40 Better Approximation Guarantees for Job-Shop Scheduling
Leslie Ann Goldberg and Mike Paterson, University of Warwick, United Kingdom; Aravind Srinivasan, National University of Singapore, Singapore; and Elizabeth Sweedyk, University of Pennsylvania
9:45-10:05 Approximation Techniques for Average Completion Time Scheduling
Chandra S. Chekuri and Rajeev Motwani, Stanford University; Balas Natarajan, Hewlett Packard Laboratories; and Cliff Stein, Dartmouth College

Registration | Hotel Information | Transportation | Program-at-a-Glance | Author Index

MMD, 10/22/96