"Complexity and Approximation for the Precedence Constrained Scheduling ..."

Rodolphe Giroudeau et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11549468_30

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/europar/GiroudeauKMP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/GiroudeauKMP05
Rodolphe Giroudeau, Jean-Claude König, Feryal-Kamila Moulaï, Jérôme Palaysi:
Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays. Euro-Par 2005: 252-261

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.