"Complexity of preemptive minsum scheduling on unrelated parallel machines."

René Sitters (2005)

> Home

Details and statistics

DOI: 10.1016/J.JALGOR.2004.06.011

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Sitters05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Sitters05
René Sitters:
Complexity of preemptive minsum scheduling on unrelated parallel machines. J. Algorithms 57(1): 37-48 (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.