Proceedings:
SOCS-22 Volume 15
Volume
Issue:
Vol. 15 No. 1 (2022): Fifteenth International Symposium on Combinatorial Search
Track:
Extended Abstracts
Downloads:
Abstract:
Probabilistic Simple Temporal Networks (PSTN) are used to represent scheduling problems under uncertainty. In a temporal network that is Strongly Controllable (SC) there exists a concrete schedule that is robust to any uncertainty. We solve the problem of determining Chance Constrained PSTN SC as a Joint Chance Constrained optimisation problem via column generation, lifting the usual assumptions of independence and Boole's inequality typically leveraged in PSTN literature. Our approach offers on average a 10 times reduction in cost versus previous methods.
DOI:
10.1609/socs.v15i1.21794
SOCS
Vol. 15 No. 1 (2022): Fifteenth International Symposium on Combinatorial Search
Published by , . All rights reserved.
Copyright ,