Constraint-directed techniques for scheduling alternative activities

DOI10.1016/S0004-3702(00)00035-7zbMath0948.68009MaRDI QIDQ1583239

J. Christopher Beck, Mark S. Fox

Publication date: 26 October 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

scheduling; constraints; heuristic search; problem structure; alternative activities

Mathematics Subject Classification ID

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

Related Items

Discovering implied constraints in precedence graphs with alternatives, Allocation and scheduling of conditional task graphs, Mathematical models for job-shop scheduling problems with routing and process plan flexibility, Heuristics for scheduling with inventory: Dynamic focus via constraint criticality, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, A theoretic and practical framework for scheduling in a stochastic environment, Agent-based distributed scheduling for virtual job shops, Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Introduction to the special issue on industrial constraint-directed scheduling
• Criteria-directed task scheduling
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
• An Algorithm for Solving the Job-Shop Problem