Constraint-directed techniques for scheduling alternative activities

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

Mark S. Fox, J. Christopher Beck

Publication date: 26 October 2000

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00035-7

zbMATH Keywords

schedulingconstraintsheuristic searchproblem structurealternative activities

Mathematics Subject Classification ID

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

Related Items

Agent-based distributed scheduling for virtual job shops ⋮ Domain-independent planning for services in uncertain and dynamic environments ⋮ A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs ⋮ Heuristics for scheduling with inventory: Dynamic focus via constraint criticality ⋮ Discovering implied constraints in precedence graphs with alternatives ⋮ Resource leveling in projects with flexible structures ⋮ Production scheduling with alternative process plans ⋮ Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models ⋮ Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics ⋮ Fuzzy job-shop scheduling problems: a review ⋮ Allocation and scheduling of conditional task graphs ⋮ A theoretic and practical framework for scheduling in a stochastic environment ⋮ Mathematical models for job-shop scheduling problems with routing and process plan flexibility ⋮ Maximising the weighted number of activity execution modes in project planning

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item