A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form

DOI10.1016/j.ic.2023.105063OpenAlexW4380742137MaRDI QIDQ6116194

Luke Hunsberger, Roberto Posenato

Publication date: 17 July 2023

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2023.105063

zbMATH Keywords

scheduling algorithmtemporal constraint networkscontingent durationsdispatchable network

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Temporal constraint networks
• Solving systems of difference constraints incrementally
• An Introduction to Constraint-Based Temporal Reasoning
• Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty
• Dynamic Controllability and Dispatchability Relationships
• Chance-constrained Static Schedules for Temporally Probabilistic Plans

This page was built for publication: A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form