Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics

DOI10.1016/S0004-3702(99)00099-5MaRDI QIDQ1978312zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

constraintsheuristic searchschedulingproblem structure

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

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

• scientific article; zbMATH DE number 4162299 (Why is no real title available?)
• scientific article; zbMATH DE number 4112072 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 795579 (Why is no real title available?)
• scientific article; zbMATH DE number 802345 (Why is no real title available?)
• A Computational Study of the Job-Shop Scheduling Problem
• A Sufficient Condition for Backtrack-Free Search
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• An Algorithm for Solving the Job-Shop Problem
• Applying constraint satisfaction techniques to job shop scheduling
• Benchmarks for basic scheduling problems
• Branching rules for satisfiability
• Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
• Consistency in networks of relations
• Constraint-directed techniques for scheduling alternative activities
• KI-94: Advances in artificial intelligence. 18th German annual conference on artificial intelligence, Saarbrücken, Germany, September 18-23, 1994. Proceedings
• Maintaining knowledge about temporal intervals
• Synthesizing constraint expressions
• Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
• The ODO project: Toward a unified basis for constraint-directed scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The job shop scheduling problem: Conventional and new solution techniques

Cited in

(11)

• Dynamic Management of Heuristics for Solving Structured CSPs
• Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
• A case study of mutual routing-scheduling reformulation
• Depth-first heuristic search for the job shop scheduling problem
• Principles for the design of large neighborhood search
• Problem difficulty for tabu search in job-shop scheduling
• Constraint-directed techniques for scheduling alternative activities
• Non-binary quantified CSP: Algorithms and modelling
• A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
• Optimisation enhancement using self‐organising fuzzy control
• A knowledge-based evolutionary strategy for scheduling problems with bottlenecks

Describes a project that uses

Uses Software

• OR-Library
• JOBSHOP
• ILOG SCHEDULE

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)