Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ginsberg, M. (2007). Of Mousetraps and Men: A Cautionary Tale. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)