JPL Technical Report Server

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

Show simple item record

dc.contributor.author Chien, S. en_US
dc.contributor.author Gratch, J. en_US
dc.date.accessioned 2004-10-05T21:43:52Z
dc.date.available 2004-10-05T21:43:52Z
dc.date.issued 1994-06-13 en_US
dc.identifier.citation Chicago, Illinois, USA en_US
dc.identifier.clearanceno 94-0537 en_US
dc.identifier.uri http://hdl.handle.net/2014/33806
dc.description.abstract One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources. en_US
dc.format.extent 227975 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.subject.other Constraint Satisfaction Problems CSP constraint propagation iterative relaxation en_US
dc.title Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account