Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Benoît Darties et al. (2016)

> Home

Details and statistics

DOI: 10.1051/RO/2016034

access: closed

type: Journal Article

metadata version: 2020-09-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rairo/DartiesGKS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/DartiesGKS16
Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin:
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. RAIRO Oper. Res. 50(4-5): 781-795 (2016)

a service of

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.