Allocation and scheduling of conditional task graphs
type: Item
instance of: scholarly article
title: Allocation and scheduling of conditional task graphs
zbMATH Open document ID: 1186.90054
author: Michele Lombardi
author: Michela Milano
published in: Artificial Intelligence
publication date: 2010-05-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5705361
zbMATH Keywords: constraint programming
zbMATH Keywords: probabilistic reasoning
zbMATH Keywords: scenarios
zbMATH Keywords: conditional task graphs
zbMATH Keywords: conditional constraints
zbMATH Keywords: optimization
describes a project that uses: BL data set
describes a project that uses: JaCoP
describes a project that uses: ILOG SCHEDULE
MaRDI profile type: Publication
full work available at URL: j.artint.2010.02.004
OpenAlex ID: W2089740569
cites work: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
cites work: A Constraint Model for State Transitions in Disjunctive Resources
cites work: Constraint-directed techniques for scheduling alternative activities
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: A theoretic and practical framework for scheduling in a stochastic environment
cites work: Q4057976
cites work: Logic-based Benders decomposition
cites work: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Scheduling Conditional Task Graphs
cites work: A branch and bound method for stochastic global optimization
cites work: Scheduling with Random Service Times
cites work: Stochastic constraint programming: A scenario-based approach
cites work: CTP: A new constraint-based formalism for conditional, temporal planning
cites work: Handling contingency in temporal constraint networks: from consistency to controllabilities
cites work: Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities
DOI: 10.1016/J.ARTINT.2010.02.004
description: scientific article; zbMATH DE number 5705361