"Approximation algorithms for the makespan minimization with positive tails ..."

Imed Kacem (2009)

> Home

Details and statistics

DOI: 10.1007/S10878-007-9102-4

access: closed

type: Journal Article

metadata version: 2017-06-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Kacem09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Kacem09
Imed Kacem:
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J. Comb. Optim. 17(2): 117-133 (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.