Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems

Paolo Detti, Alessandro Agnetis, Gianfranco Ciaschetti. Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems. J. Scheduling, 8(3):255-273, 2005. [doi]

@article{DettiAC05,
  title = {Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems},
  author = {Paolo Detti and Alessandro Agnetis and Gianfranco Ciaschetti},
  year = {2005},
  doi = {10.1007/s10951-005-6814-0},
  url = {http://dx.doi.org/10.1007/s10951-005-6814-0},
  tags = {mobile},
  researchr = {https://researchr.org/publication/DettiAC05},
  cites = {0},
  citedby = {0},
  journal = {J. Scheduling},
  volume = {8},
  number = {3},
  pages = {255-273},
}