Perpetual scheduling with explorable uncertainty

DOI10.1007/978-3-031-92935-9_21MaRDI QIDQ6902097zbMATH OpenFDO

Authors W. D. Evans, Seyed Ali Tabatabaee

Publication date 11 November 2025

zbMATH Keywords

explorable uncertaintyscheduling with testingwindows schedulingperpetual schedulingbamboo trimming

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Perpetual scheduling with explorable uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902097)