Approximation Schemes in Scheduling
I will survey some general methods for deriving a PTAS/FPTAS for scheduling problems. All these methods are based on rounding and enumeration methods, sometimes combined with dynamic programming or integer programming formulations. Moreover, I will discuss methods for disproving the existence of a PTAS or FPTAS for specific scheduling problems (under P not= NP)