|
BEACON eSpace at Jet Propulsion Laboratory >
JPL Technical Report Server >
JPL TRS 1992+ >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2014/33806
|
| Title: | Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach |
| Authors: | Chien, S.
Gratch, J. |
| Issue Date: | 13-Jun-1994 |
| Citation: | Chicago, Illinois, USA |
| 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. |
| URI: | http://hdl.handle.net/2014/33806 |
| Appears in Collections: | JPL TRS 1992+
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
