"Some complexity and approximation results for coupled-tasks scheduling ..."

Benoît Darties et al. (2017)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2024-10-06

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/DartiesGKS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/DartiesGKS17
Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin:
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. CoRR abs/1706.02214 (2017)

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.