BibTeX record journals/scheduling/EpsteinY17

download as .bib file

@article{DBLP:journals/scheduling/EpsteinY17,
  author       = {Leah Epstein and
                  Ido Yatsiv},
  title        = {Preemptive scheduling on uniformly related machines: minimizing the
                  sum of the largest pair of job completion times},
  journal      = {J. Sched.},
  volume       = {20},
  number       = {2},
  pages        = {115--127},
  year         = {2017},
  url          = {https://doi.org/10.1007/s10951-016-0476-y},
  doi          = {10.1007/S10951-016-0476-Y},
  timestamp    = {Wed, 01 Apr 2020 08:42:04 +0200},
  biburl       = {https://dblp.org/rec/journals/scheduling/EpsteinY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.