"Efficient Construction of Minimum Makespan Schedules for Tasks with a ..."

Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi (2001)

> Home

Details and statistics

DOI: 10.1007/S004530010079

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/RosenkrantzYR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/RosenkrantzYR01
Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi:
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. Algorithmica 30(1): 83-100 (2001)

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.