Computing and scheduling with explorable uncertainty

DOI10.1007/978-3-319-94418-0_16OpenAlexW2811267922MaRDI QIDQ1670736

Erlebach, Thomas

Publication date: 6 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94418-0_16

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A robust optimization approach with probe-able uncertainty ⋮ Scheduling with a processing time oracle

This page was built for publication: Computing and scheduling with explorable uncertainty