@InProceedings{durr_et_al:LIPIcs.ITCS.2018.30,
  author =	{D\"{u}rr, Christoph and Erlebach, Thomas and Megow, Nicole and Mei{\ss}ner, Julie},
  title =	{{Scheduling with Explorable Uncertainty}},
  booktitle =	{9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
  pages =	{30:1--30:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-060-6},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{94},
  editor =	{Karlin, Anna R.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.30},
  URN =		{urn:nbn:de:0030-drops-83360},
  doi =		{10.4230/LIPIcs.ITCS.2018.30},
  annote =	{Keywords: online scheduling, explorable uncertainty, competitive ratio, makespan, sum of completion times}
}