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

DOI10.1016/S0004-3702(99)00099-5zbMath0939.68536OpenAlexW2104290979MaRDI QIDQ1978312

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

schedulingconstraintsheuristic searchproblem structure

Mathematics Subject Classification ID

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

Related Items (10)

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

Uses Software

• OR-Library
• JOBSHOP
• ILOG SCHEDULE

Cites Work

• Maintaining knowledge about temporal intervals
• Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
• Consistency in networks of relations
• The job shop scheduling problem: Conventional and new solution techniques
• 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
• Adjustment of heads and tails for the job-shop problem
• Applying constraint satisfaction techniques to job shop scheduling
• Constraint-directed techniques for scheduling alternative activities
• Branching rules for satisfiability
• Benchmarks for basic scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• A Sufficient Condition for Backtrack-Free Search
• A Computational Study of the Job-Shop Scheduling Problem
• Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
• Synthesizing constraint expressions
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics