Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times

DOI10.1007/978-3-319-89441-6_16zbMath1504.90060arXiv1709.05896OpenAlexW2754915973MaRDI QIDQ1644941

Sören Riechers, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide

Publication date: 22 June 2018

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

zbMATH Keywords

schedulingflow timesetup timessmoothed analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

This page was built for publication: Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times