Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
From MaRDI portal
Publication:814422
DOI10.1016/S0004-3702(02)00362-4zbMath1079.68622OpenAlexW2102433499MaRDI QIDQ814422
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00362-4
Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (28)
Relocation scheduling subject to fixed processing sequences ⋮ Domain-independent planning for services in uncertain and dynamic environments ⋮ Managing concurrency in temporal planning using planner-scheduler interaction ⋮ Principles for the design of large neighborhood search ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ On the integration of diverging material flows into resource-constrained project scheduling ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ A case study of mutual routing-scheduling reformulation ⋮ Applying local rescheduling in response to schedule disruptions ⋮ Lower bounds for the event scheduling problem with consumption and production of resources ⋮ Hybrid differential evolution algorithm for the resource constrained project scheduling problem with a flexible project structure and consumption and production of resources ⋮ Approximation schemes for parallel machine scheduling with non-renewable resources ⋮ Scheduling Conditional Task Graphs ⋮ An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem ⋮ A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem ⋮ Branching and pruning: An optimal temporal POCL planner based on constraint programming ⋮ Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources ⋮ The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm ⋮ Allocation and scheduling of conditional task graphs ⋮ Optimal resource allocation and scheduling for the CELL BE platform ⋮ Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip ⋮ Scheduling of continuous and discontinuous material flows with intermediate storage restrictions ⋮ Continuous filling and emptying of storage systems in constraint-based scheduling ⋮ A cyclic approach to large-scale short-term planning in chemical batch production ⋮ Complexity of single machine scheduling subject to nonnegative inventory constraints ⋮ Scheduling scientific experiments for comet exploration ⋮ Approximability of scheduling problems with resource consuming jobs ⋮ Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Planning for conjunctive goals
- Temporal constraint networks
- Applying constraint satisfaction techniques to job shop scheduling
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- On not-first/not-last conditions in disjunctive scheduling
- Project scheduling with inventory constraints
- Solving various weighted matching problems with constraints
- Applying tabu search to the job-shop scheduling problem
- Multiple-Machine Lower Bounds for Shop-Scheduling Problems
- A constraint-based method for project scheduling with time windows
This page was built for publication: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
