BibTeX Export for Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models

Copy to Clipboard Download

@InProceedings{kulkarni_et_al:LIPIcs.APPROX-RANDOM.2018.16,
  author =	{Kulkarni, Janardhan and Li, Shi},
  title =	{{Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
  pages =	{16:1--16:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-085-9},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{116},
  editor =	{Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.16},
  URN =		{urn:nbn:de:0030-drops-94205},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2018.16},
  annote =	{Keywords: Approximation, Weighted Flow Time, Concurrent Open Shop, Precedence Constraints}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail