Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
From MaRDI portal
Publication:1978312
DOI10.1016/S0004-3702(99)00099-5zbMATH Open0939.68536OpenAlexW2104290979MaRDI QIDQ1978312FDOQ1978312
Authors: J. Christopher Beck, Mark S. Fox 
Publication date: 4 June 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00099-5
Recommendations
- A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
- Dynamic Management of Heuristics for Solving Structured CSPs
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
- Dynamic problems of scheduling
- scientific article; zbMATH DE number 1946760
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
Cites Work
- A Computational Study of the Job-Shop Scheduling Problem
- Maintaining knowledge about temporal intervals
- Title not available (Why is that?)
- Consistency in networks of relations
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A Sufficient Condition for Backtrack-Free Search
- Constraint-directed techniques for scheduling alternative activities
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Benchmarks for basic scheduling problems
- An Algorithm for Solving the Job-Shop Problem
- The job shop scheduling problem: Conventional and new solution techniques
- Applying constraint satisfaction techniques to job shop scheduling
- Title not available (Why is that?)
- Branching rules for satisfiability
- Adjustment of heads and tails for the job-shop problem
- Synthesizing constraint expressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
- Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
- Title not available (Why is that?)
- The ODO project: Toward a unified basis for constraint-directed scheduling
- KI-94: Advances in artificial intelligence. 18th German annual conference on artificial intelligence, Saarbrücken, Germany, September 18-23, 1994. Proceedings
Cited In (11)
- A case study of mutual routing-scheduling reformulation
- Problem difficulty for tabu search in job-shop scheduling
- Dynamic Management of Heuristics for Solving Structured CSPs
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
- Constraint-directed techniques for scheduling alternative activities
- Optimisation enhancement using self‐organising fuzzy control
- Principles for the design of large neighborhood search
- Depth-first heuristic search for the job shop scheduling problem
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- Non-binary quantified CSP: Algorithms and modelling
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
Uses Software
This page was built for publication: Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978312)
