"Optimal and online preemptive scheduling on uniformly related machines."

Tomás Ebenlendr, Jirí Sgall (2009)

> Home

Details and statistics

DOI: 10.1007/S10951-009-0119-7

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/EbenlendrS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/EbenlendrS09
Tomás Ebenlendr, Jirí Sgall:
Optimal and online preemptive scheduling on uniformly related machines. J. Sched. 12(5): 517-527 (2009)

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.