Skip to main content
Article thumbnail
Location of Repository

Super solutions in constraint programming

By Emmanuel Hebrard, Cork Constraint and Computation Centre

Abstract

1 Introduction Where changes to a solution introduce additional expenses or reorganization,solution robustness is a valuable property. A robust solution is less sensitive to changes. For example, a robust schedule will not collapse immediately when onejob takes slightly longer to execute than planned. The schedule should change locally and in small proportions, and the overall makespan should change littleif at all. To improve solution robustness, we introduce the concept of super-solutionsto constraint programming (CP). An

Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.8342
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://sunsite.informatik.rwth... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.