"Computing optimal preemptive schedules for parallel tasks: linear ..."

Klaus Jansen, Lorant Porkolab (2003)

> Home

Details and statistics

DOI: 10.1007/S10107-002-0361-7

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/JansenP03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/JansenP03
Klaus Jansen, Lorant Porkolab:
Computing optimal preemptive schedules for parallel tasks: linear programming approaches. Math. Program. 95(3): 617-630 (2003)

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.