Precedence-constrained scheduling problems parameterized by partial order width.
René van BevernRobert BredereckLaurent BulteauChristian KomusiewiczNimrod TalmonGerhard J. WoegingerPublished in: CoRR (2016)
Keyphrases
- partial order
- scheduling problem
- partially ordered
- precedence constraints
- single machine
- total order
- flowshop
- processing times
- tabu search
- stable marriage
- lattice structure
- np hard
- job shop scheduling problem
- partial ordering
- sequencing problems
- preference relations
- set theory
- dominance relation
- parallel machines
- sequential patterns
- multi agent