×

System, utilized in scheduling, or the like, for satisfying constraints by allowing relaxation of constraints

  • US 5,353,229 A
  • Filed: 10/30/1992
  • Issued: 10/04/1994
  • Est. Priority Date: 12/26/1991
  • Status: Expired due to Fees
First Claim
Patent Images

1. A system, utilized in scheduling, for satisfying constraints by allowing relaxation of constraints, comprising:

  • means for obtaining a final solution which specifies values that all variables can assume by repeating a problem solving cycle consisting of generation of a partial solution which refines values that some or all constraints of a constraint group can assume, and a test of checking whether or not the generated solution satisfies each of the constraints;

    constraint relaxation necessity detection means for detecting necessity of relaxation of some constraints during execution of the problem solving cycle;

    constraint relaxation knowledge management means for managing stored information associated with a possibility of relaxation and a method of relaxation, and a procedure to be enabled to know a relaxation condition from an external source in correspondence with each of the constraints;

    relaxation target constraint selection means for, when said constraint relaxation necessity detection means detects the necessity of relaxation of some constraint, selecting a constraint to be relaxed from the constraint group; and

    constraint relaxation means for checking the possibility of relaxation of the constraint selected by said relaxation target constraint selection means upon reception of information stored in said constraint relaxation knowledge management means, and for, when it is determined that relaxation is possible, executing relaxation of the constraint.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×