J. C. Beck, "A Schema for Constraint Relaxation with Instantiations for Partial Constraint Satisfaction and Schedule Optimization," Master's Thesis, Department of Computer Science, University of Toronto, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Heuristic Methods for Solving Job-Shop Scheduling.. - Garrido, Salido.. (2000) (Correct)
....i k ) requires the use of a set of resources (R i k R) during a time interval (du i k ) The start time st i k of operation O i k indicates when the operation may begin to use the resources R k . The problem of job shop scheduling can be considered as a Constraint Satisfaction Problem [1], with the following elements: A set of variables x 1 , x n associated with the start time of operations. These variables take values in finite domains D 1 , D n that may be constrained by unary constraints over each variable. In these problems, time is usually assumed discrete, with ....
....Thus, an efficient search, by means of an incremental method, should establish an appropriate order for instantiating the variables and obtain the order to select the values from the domains. This incremental method can be applied with two main techniques: retrospective and prospective techniques [1]. Retrospective techniques that assign a value to a variable checking other variables with assigned values in order to avoid conflicts. If all constraints hold, another variable and value are selected. Otherwise, some constraint is not satisfied and backtracking occurs. The simplest ....
[Article contains additional citation context not shown here]
J.C. Beck, A Schema for Constraint Relaxation with Instantiations for Partial Constraint Satisfaction and Schedule Optimization, Master's Thesis, Technical Report EIT-94-3, University of Toronto, (1994).
Supply Chain Coordination via Mediated Constraint Relaxation - Christopher Beck (1994) (4 citations) Self-citation (Beck) (Correct)
....the MMV relaxation algorithms due to exponential growth in memory use. The weakness of the both the relaxation algorithms and the PCSP algorithms is their exponential complexity. None of these algorithms will scale up to problems much larger than 15 variables. 7. Cycle detection is addressed in [Beck 94] 8. For further information see [Beck 94] Algorithms Problem Sets 1 2 3 4 5 6 PEFC3 Avg. Checks 4664 1460 18077 9700 17221190 592303 Avg. Cost 3.1 8.9 4.1 12.7 7.6 23.4 MMVLH1 Avg. Checks 1871 1055 5329 2686 Avg. Cost 3.3 11.6 4.2 14.2 MMVLH2 Avg. Checks 2647 1647 8315 5200 Avg. ....
....growth in memory use. The weakness of the both the relaxation algorithms and the PCSP algorithms is their exponential complexity. None of these algorithms will scale up to problems much larger than 15 variables. 7. Cycle detection is addressed in [Beck 94] 8. For further information see [Beck 94] Algorithms Problem Sets 1 2 3 4 5 6 PEFC3 Avg. Checks 4664 1460 18077 9700 17221190 592303 Avg. Cost 3.1 8.9 4.1 12.7 7.6 23.4 MMVLH1 Avg. Checks 1871 1055 5329 2686 Avg. Cost 3.3 11.6 4.2 14.2 MMVLH2 Avg. Checks 2647 1647 8315 5200 Avg. Cost 3.1 10.4 4.1 13.9 SMVLH5 Avg. ....
Beck, J.C. A Schema for Constraint Relaxation with Instantiations for Partial Constraint Satisfaction and Schedule Optimization. Master's thesis, University of Toronto, 1994. To Appear.
Five Pitfalls of Empirical Scheduling Research - Beck, Davenport, Fox (1997) (1 citation) Self-citation (Beck) (Correct)
....that have received little treatment in the literature. There are also a host of higher level issues such as the robustness of schedules and the ease of rescheduling at execution time [Ow et al. 1988; Drummond et al. 1994; Hildum, 1994] relaxation of constraints in over constrained problems [Beck, 1994], and, more generally, what constitutes a good solution. For example, imagine a system that creates schedules with a probabilistic measure of the ability to execute the schedule. Rather than guaranteeing a executable schedule (as is part of the definition of a solution in the research world) the ....
Beck, J. C. (1994). A schema for constraint relaxation with instantiations for partial constraint satisfaction and schedule optimization. Master's thesis, Department of Computer Science, University of Toronto.
Automated E-business Negotiation: Model, Life Cycle and.. - Li, Su, Lam, Huang (Correct)
No context found.
J. C. Beck, "A Schema for Constraint Relaxation with Instantiations for Partial Constraint Satisfaction and Schedule Optimization," Master's Thesis, Department of Computer Science, University of Toronto, 1994.
Planning Aircraft Movements on Airports With Constraint.. - Hesselink, Paul (1998) (Correct)
No context found.
Ref. 3. Beck, J.C. (1994). A Schema for Constraint Relaxation with Instantiations for Partial Constraint Satisfaction and Schedule Optimization, Masters Thesis, University of Toronto.
The Architecture of an Agent Based Infrastructure for Agile.. - Barbuceanu, Fox (1995) (2 citations) (Correct)
No context found.
J.C. Beck, A Schema for Constraint Relaxation with Instantiations for Partial Constraint Satisfaction and Schedule Optimization, MSc. Thesis, University of Toronto, 1994. (also released as a technical report EIT-94-3)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC