Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width.
René van BevernRobert BredereckLaurent BulteauChristian KomusiewiczNimrod TalmonGerhard J. WoegingerPublished in: DOOR (2016)
Keyphrases
- partial order
- scheduling problem
- partially ordered
- precedence constraints
- total order
- single machine
- flowshop
- stable marriage
- processing times
- tabu search
- partial ordering
- np hard
- set theory
- job shop
- conceptual graphs
- lattice structure
- parallel machines
- job shop scheduling problem
- sequencing problems
- data structure
- preference relations
- maximum weight
- totally ordered