IEOR 44051 Basic Project Scheduling. IEOR 44052 Project Scheduling zJobs subject to precedence constraints zJob on arc format (most common) 25 14 3 6.
Approximation Algorithms Load Balancing k-center selection Pricing Method Vertex Cover Set Cover Bin Packing TSP.
Techniques for truthful scheduling Rob van Stee Max Planck Institute for Informatics (MPII) Germany.
An Optimal Lower Bound for Anonymous Scheduling Mechanisms
Spring 2002IE 5141 Topic 11 Basic Project Scheduling.
1 Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved.