John Turner PhD Student, Operations Research Tepper School of Business Carnegie Mellon University Pittsburgh, PA  15213 Office: GSIA A19c Tel: (412) 268-2463

I am currently starting work on my second summer paper, which deals with the revenue management of advertisements placed in video games. For this project, I am collaborating with professors Alan Scheller-Wolf and Sridhar Tayur.

Last summer, I started a working paper entitled Robust Solutions to the Resource-Constrained Project Scheduling Problem. The paper, which was written under the supervision of professors John Hooker and Mike Trick, introduces a robust objective which seeks to minimize the total number of precedence relationships in a schedule. We focussed on the special case of RCPSP that has a single resource and whose temporal constraints are precedence constraints. To our knowledge, this objective has not been previously studied in the context of project scheduling. By employing a generalization of Dilworth's Theorem, we develop a MILP and then suggest the use of Bender's Decomposition to solve this MILP. Computational testing is in progress.