Patent US5353229A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5353229A Expired / Lapsed US ⏱️ 0.0 years remaining

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

Assignee: Toshiba Corp
•
Filing: 1992-10-30
•
Granted: 1994-10-04
•
Expires: 2012-10-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a system, utilized in, e.g., scheduling, for satisfying constraints by allowing relaxation of constraints, a constraint relaxation necessity detection section detects necessity of constraint relaxation in a problem solving cycle of a problem solving section. When the necessity of constraint relaxation is detected, a relaxation target constraint selection section is enabled to select a constraint to be relaxed from a constraint group. A constraint relaxation section searches a constraint relaxation knowledge management section in association with the selected constraint to check if a partial solution satisfies a relaxation permission condition. If the relaxation permission condition is satisfied, constraint relaxation is attempted according to a relaxation method recorded in correspondence with the relaxation permission condition. When the constraint relaxation is executed, the constraint relaxation necessity detection section checks if the constraint relaxation is successful, and the control returns to the problem solving cycle of the problem solving section.

Inventors

  • 👤 Toshikazu Tanaka

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 15:59
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/06

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 212 words
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.
Claim 2
Independent Claim 212 words
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.
Claim 3
Independent Claim 331 words
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 constraint 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; 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; relaxation reason acquisition means for, when said constraint relaxation means executes the procedure according to the information associated with the procedure to be enabled to know a relaxation condition from the external source, which information is stored in said constraint relaxation knowledge management means, and knows the relaxation condition from the external source, acquiring a relaxation reason; relaxation knowledge generation means for analyzing the relaxation reason input from said relaxation reason acquisition means, and generating a determination condition for determining possibility of relaxation of a constraint and a relaxation method; and relaxation knowledge addition means for adding the determination condition information and the relaxation method information generated by said relaxation knowledge generation means to said constraint relaxation knowledge management means.
Claim 4
Independent Claim 331 words
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 constraint 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; 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; relaxation reason acquisition means for, when said constraint relaxation means executes the procedure according to the information associated with the procedure to be enabled to know a relaxation condition from the external source, which information is stored in said constraint relaxation knowledge management means, and knows the relaxation condition from the external source, acquiring a relaxation reason; relaxation knowledge generation means for analyzing the relaxation reason input from said relaxation reason acquisition means, and generating a determination condition for determining possibility of relaxation of a constraint and a relaxation method; and relaxation knowledge addition means for adding the determination condition information and the relaxation method information generated by said relaxation knowledge generation means to said constraint relaxation knowledge management means.
Claim 5
Dependent Claim 49 words
A system according to claim 1, wherein the possibility of relaxation comprises a relaxation permission condition corresponding to each constraint, and wherein said constraint relaxation means searches said constraint relaxation knowledge management means to check if the partial solution satisfies the relaxation permission condition corresponding to the selected constraint.
Claim 6
Dependent Claim 29 words
A system according to claim 3, wherein said constraint relaxation means executes relaxation of the selected constraint according to a method of relaxation corresponding to the relaxation permission condition.

References Cited (Backward Citations)

US3987281A Cited
US5136538A Cited
US5053970A Cited
US4896269A Cited
US5093794A Cited
US5212791A Cited
US5276775A Cited
US5216593A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-10-03 1998-04-04 1998-10-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-10-03 2002-04-04 2002-10-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-10-03 2006-04-04 2006-10-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag