2 results
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
-
- Journal:
- RAIRO - Operations Research / Volume 36 / Issue 1 / January 2002
- Published online by Cambridge University Press:
- 15 July 2002, pp. 21-36
- Print publication:
- January 2002
-
- Article
- Export citation
The complexity of short schedules for uet bipartite graphs
-
- Journal:
- RAIRO - Operations Research / Volume 33 / Issue 3 / July 1999
- Published online by Cambridge University Press:
- 15 August 2002, pp. 367-370
- Print publication:
- July 1999
-
- Article
- Export citation