"Schedule Robustness Through Broader Solve and Robustify Search for ..."

Nicola Policella et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11558590_16

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aiia/PolicellaCOS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiia/PolicellaCOS05
Nicola Policella, Amedeo Cesta, Angelo Oddi, Stephen F. Smith:
Schedule Robustness Through Broader Solve and Robustify Search for Partial Order Schedules. AI*IA 2005: 160-172

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.