"A branch-and-bound algorithm to compute a tighter bound to tardiness for ..."

Mauro Leoncini, Manuela Montangero, Paolo Valente (2017)

> Home

Details and statistics

DOI: 10.1145/3139258.3139277

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/rtns/LeonciniMV17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rtns/LeonciniMV17
Mauro Leoncini, Manuela Montangero, Paolo Valente:
A branch-and-bound algorithm to compute a tighter bound to tardiness for preemptive global EDF scheduler. RTNS 2017: 128-137

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.