Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2004: Principles and Practice of Constraint Programming – CP 2004 pp 798Cite as

Extending Super-solutions

  • Conference paper

  • 1551 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3258))

Abstract

Super solutions, introduced first for SAT problems in [1], are solutions in which, if a small number of variables lose their values, we are guaranteed to be able to repair the solution with only a few changes. In this paper, we stress the need to extend the super-solution framework along several dimensions to make it more useful practically.

For instance, consider the jobshop scheduling problem (jsp). A jsp involves a set of jobs (sequences of activities) and a set of machines. The objective is to schedule the jobs such that no machine is required by two activities that overlap, and the makespan is minimized. A jsp can be formulated as a CSP, with one variable for each activity, and a domain size equal to the makespan minus its duration. To find the minimal makespan, one starts with the makespan equal to a lower bound and increase it till a solution exists.

The author is supported by Science Foundation Ireland and an ILOG grant.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ginsberg, M., Parkes, A., Roy, A.: Supermodels and robustness. In: Proceedings AAAI 1998, Madison WI, pp. 334–339 (1998)

    Google Scholar 

  2. Vidal, T., Fargier, H.: Contingent durations in temporal csps: from consistency to controllabilities. In: TIME 1997, Daytona Beach, USA (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cork Constraint Computation Center, University College Cork, Ireland

    Emmanuel Hebrard

Authors
  1. Emmanuel Hebrard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Clayton School of IT, Monash University, Australia

    Mark Wallace

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hebrard, E. (2004). Extending Super-solutions. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_77

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30201-8_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23241-4

  • Online ISBN: 978-3-540-30201-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation