BibTeX record journals/dam/ChenY21a

download as .bib file

@article{DBLP:journals/dam/ChenY21a,
  author       = {Rubing Chen and
                  Jinjiang Yuan},
  title        = {Unary NP-hardness of preemptive scheduling to minimize total completion
                  time with release times and deadlines},
  journal      = {Discret. Appl. Math.},
  volume       = {304},
  pages        = {45--54},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.07.031},
  doi          = {10.1016/J.DAM.2021.07.031},
  timestamp    = {Tue, 26 Oct 2021 17:19:13 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/ChenY21a.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.