Approximating bounded job start scheduling with application in Royal Mail deliveries under uncertainty

DOI10.1007/978-3-030-36412-0_6zbMath1439.90031arXiv1912.06862MaRDI QIDQ2180134

Ruth Misener, Jeremy T. Bradley, Natasha Page, Dimitrios Letsios

Publication date: 13 May 2020

Full work available at URL: https://arxiv.org/abs/1912.06862

zbMATH Keywords

approximation algorithms; robust scheduling; bounded job start scheduling; mail deliveries

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68W25: Approximation algorithms

90C17: Robustness in mathematical programming