Beck, J.Ch., Fox, M.S.: Dynamic Problem Structure Analysis as a Basis for Constraint-Directed Scheduling Heuristics. Artificial Intelligence 117, pp. 31-81. (2000) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Job Shop Scheduling with Probabilistic Durations - Beck, Wilson Self-citation (Beck) (Correct)
No context found.
J. C. Beck and M. S. Fox, `Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics', Artificial Intelligence, 117(1), 31--81, (2000).
On the Reformulation of Vehicle Routing Problems and.. - Beck, Prosser, Selensky (2002) (3 citations) Self-citation (Beck) (Correct)
No context found.
J. C. Beck and M. S. Fox. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Arti cial Intelligence, 117(1):31-81, 2000.
Graph Transformations for the Vehicle Routing and Job.. - Beck, Prosser, Selensky (2002) Self-citation (Beck) (Correct)
No context found.
J. C. Beck and M. S. Fox. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence, 117(1):31--81, 2000.
Problem Difficulty for Tabu Search in Job-Shop Scheduling - Watson, Beck, Howe, Whitley (2002) (3 citations) Self-citation (Beck) (Correct)
No context found.
J. C. Beck, M. S. Fox, Dynamic problem structure analysis as a basis for constraintdirected scheduling heuristics, Artificial Intelligence 117 (2) (2000) 31--81.
Toward an Understanding of Local Search Cost in Job-Shop .. - Watson, Beck, Howe.. (2001) (1 citation) Self-citation (Beck) (Correct)
....and work ow JSP instances at each of the following backbone sizes: 0:1, 0:3, 0:5, 0:7, and 0:9. Finally, we used a constraint directed scheduling algorithm to compute the optimal makespan, the backbone size, and to enumerate all optimal solutions. The speci c algorithm is documented in [11]. 5 A Descriptive Cost Model for the General JSP A priori, it is unclear whether the factors present in the MAX SAT cost models a ect problem diculty in the JSP. The MAX SAT search space is dominated by plateaus of equally t quasi solutions, and the main challenge for local search is to either ....
Beck, J.C., Fox, M.S.: Dynamic problem structure analysis as a basis for constraintdirected scheduling heuristics. Arti cial Intelligence 117 (2000) 31-81
Problem Difficulty for Tabu Search in Job-Shop Scheduling - Watson, Beck, Howe, Whitley (2002) (3 citations) Self-citation (Beck) (Correct)
....runs of TS Taillard , which requires considerable CPU time for even small JSPs. Consequently, extensive analysis of static cost models for larger general JSPs (e.g. 10 10) is currently impractical. For each of the 2000 problem instances, we used an independent implementation of Beck and Fox s [5] constraint directed scheduling algorithm to compute the optimal makespan and to enumerate the set of optimal solutions. Finally, we note that the distribution of log 10 (cost med ) is approximately normal for both problem groups, with any deviation due to the presence of a few very high cost ....
....move operator than TS Taillard , and employs an intensification mechanism (see Section 3.3) van Laarhoven et al. s algorithm provides a well known alternative local search paradigm to tabu search. The constructive algorithm we consider is Beck and Fox s constraint directed scheduling algorithm [5], which was selected because it shares little in common with local search algorithms for the JSP. In all three cases, the search cost (as measured by the median search cost over 1000 independent trials for the two local search algorithms, and the number of nodes visited by the constructive ....
J. Christopher Beck and Mark S. Fox. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence, 117(2):31--81, 2000.
A Hybrid Approach to Scheduling with Earliness and Tardiness.. - Beck, Refalo (2001) (1 citation) Self-citation (Beck) (Correct)
....evolving problem representation [2] In constraint based scheduling, for example, it is common to infer precedence constraints which state that one activity must start after the completion of another activity. The addition of constraints to the problem model can also be used as a branching rule [22, 4]. The gain in merging two techniques with complementary strengths is that each solver can derive information that is not easily available to the other. By sharing this information between the solvers, stronger problem solving performance can be achieved. Cooperative solvers have been shown to be ....
....MIP techniques tend to focus on violated integrality conditions, guiding heuristic search with the characteristics of these violations. In our approach, we use the violated resource capacity constraints to guide heuristic search. From a scheduling perspective, the use of texture measurements [4, 1, 3, 20] and resource profiles [8 10] to estimate resource usage and guide heuristic search is a well established technique. The primary contribution of this paper and the technique that results in significant gains in problem solving performance is the identification of a cost relevant subproblem (CRS) ....
[Article contains additional citation context not shown here]
J. C. Beck and M. S. Fox. Dynamic problem structure analysis as a basis for constraintdirected scheduling heuristics. Artificial Intelligence, 117(1):31--81, 2000.
Slack-based Techniques for Robust Schedules - Davenport, Gefflot, Beck (5 citations) Self-citation (Beck) (Correct)
....assigning a start time forces the slack (as de ned in equation 1) to be 0. Therefore, rather than being able to use arbitrary scheduling techniques, we must use scheduling techniques that reason about the order of activities on resources. Fortunately, such techniques are not uncommon (e.g. SC93,BF00] 5 Focused Time Window Slack Neither temporal protection nor TWS take into account the placement of activities on the scheduling horizon. For example, consider scheduling a newly repaired machine whose tbf (R) is 1000 days and whose tbf (R) is 50 days. Given the negligible probability of ....
J. C. Beck and M. S. Fox. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Articial Intelligence, 117(1):31{ 81, 2000.
Toward an Understanding of Local Search Cost in Job-Shop .. - Watson, Beck, Howe.. (2001) (1 citation) Self-citation (Beck) (Correct)
....and workflow JSP instances at each of the following backbone sizes: 0:1, 0:3, 0:5, 0:7, and 0:9. Finally, we used a constraint directed scheduling algorithm to compute the optimal makespan, the backbone size, and to enumerate all optimal solutions. The specific algorithm is documented in [BF00] features include the min slack variable and value ordering heuristics [CS97] and constraint propagators based on edge finding [Nui94] 5 A Descriptive Cost Model for the General JSP It is unclear, a priori, whether the factors in the SAT cost model are relevant to local search in the JSP. In ....
J. Christopher Beck and Mark S. Fox. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence, 117(2):31-- 81, 2000.
Completable Partial Solutions in Constraint - Programming And Constraint-Based (Correct)
No context found.
Beck, J.Ch., Fox, M.S.: Dynamic Problem Structure Analysis as a Basis for Constraint-Directed Scheduling Heuristics. Artificial Intelligence 117, pp. 31-81. (2000)
Novel Models and Algorithms for Integrated - Production Planning And (Correct)
No context found.
J.Ch. Beck and M.S. Fox. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence, 117:31--81, 2000.
Linking Search Space Structure, Run-Time Dynamics, and.. - Watson, Whitley, Howe (2004) (Correct)
No context found.
Beck, J., & Fox, M. (2000). Dynamic problem structure analysis as a basis for constraintdirected scheduling heuristics. Artificial Intelligence, 117 (1), 31--81.
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