Scheduling Partially Ordered Jobs Faster than 2 n.
Marek CyganMarcin PilipczukMichal PilipczukJakub Onufry WojtaszczykPublished in: Algorithmica (2014)
Keyphrases
- partially ordered
- precedence constraints
- partial order
- release dates
- precedence relations
- identical machines
- maximum lateness
- identical parallel machines
- parallel machines
- sequence dependent setup times
- job scheduling
- setup times
- single machine scheduling problem
- scheduling problem
- minimize total
- unrelated parallel machines
- totally ordered
- partial ordering
- processing times
- single machine
- scheduling strategy
- release times
- optimal scheduling
- interval valued
- event calculus
- possibilistic logic
- wafer fabrication
- flowshop
- computational grids
- total order
- deteriorating jobs
- competitive ratio
- scheduling jobs
- scheduling algorithm
- special case
- weighted tardiness
- batch processing
- fixed number
- data structure
- flexible manufacturing systems
- scheduling policies
- batch processing machines