This talk consists of two interwoven stories. The Happy Story presents a technical solution to the problem of optimizing for cost instead of the more normal metric of duration. We describe a mechanism whereby the optimization problem is split into an evaluation component, where the projected cost of a schedule is evaluated using dynamic programming techniques, and a search component, where search is conducted in “window space” to find a cost-efficient schedule.