"Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in ..."

Paolo Detti, Alessandro Agnetis, Gianfranco Ciaschetti (2005)

> Home

Details and statistics

DOI: 10.1007/S10951-005-6814-0

access: closed

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/DettiAC05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/DettiAC05
Paolo Detti, Alessandro Agnetis, Gianfranco Ciaschetti:
Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems. J. Sched. 8(3): 255-273 (2005)

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.