Scheduling partially ordered jobs faster than 2^n
Marek CyganMarcin PilipczukMichal PilipczukJakub Onufry WojtaszczykPublished in: CoRR (2011)
Keyphrases
- partially ordered
- precedence constraints
- partial order
- release dates
- precedence relations
- identical parallel machines
- identical machines
- maximum lateness
- sequence dependent setup times
- parallel machines
- partial ordering
- job scheduling
- single machine scheduling problem
- scheduling problem
- minimize total
- fixed number
- setup times
- single machine
- optimal scheduling
- release times
- unrelated parallel machines
- interval valued
- event calculus
- totally ordered
- scheduling jobs
- scheduling strategy
- wafer fabrication
- processing times
- total order
- weighted tardiness
- computational grids
- possibilistic logic
- deteriorating jobs
- scheduling algorithm
- total ordering
- scheduling decisions
- batch processing machines
- completion times