On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications.
Evripidis BampisRodolphe GiroudeauJean-Claude KönigPublished in: RAIRO Oper. Res. (2002)
Keyphrases
- scheduling problem
- np hard
- single machine
- tabu search
- flowshop
- monte carlo
- minimizing makespan
- setup times
- np complete
- worst case
- hierarchical structure
- approximation algorithms
- earliness tardiness
- processing times
- learning theory
- precedence constraints
- permutation flowshop
- uct algorithm
- total tardiness
- general game playing
- np hardness
- hierarchical model
- communication systems
- phase transition
- communication networks