Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Preemptive scheduling on uniformly related machines: minimizing the sum of ..."

Leah Epstein, Ido Yatsiv (2017)

> Home

Details and statistics

DOI: 10.1007/S10951-016-0476-Y

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/EpsteinY17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/EpsteinY17
Leah Epstein, Ido Yatsiv:
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times. J. Sched. 20(2): 115-127 (2017)

a service of

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.