The complexity of short schedules for uet bipartite graphs
RAIRO - Operations Research - Recherche Opérationnelle, Volume 33 (1999) no. 3, pp. 367-370.
@article{RO_1999__33_3_367_0,
     author = {Bampis, Evripidis},
     title = {The complexity of short schedules for uet bipartite graphs},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {367--370},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {3},
     year = {1999},
     mrnumber = {1721640},
     zbl = {0953.68019},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1999__33_3_367_0/}
}
TY  - JOUR
AU  - Bampis, Evripidis
TI  - The complexity of short schedules for uet bipartite graphs
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1999
SP  - 367
EP  - 370
VL  - 33
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1999__33_3_367_0/
LA  - en
ID  - RO_1999__33_3_367_0
ER  - 
%0 Journal Article
%A Bampis, Evripidis
%T The complexity of short schedules for uet bipartite graphs
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1999
%P 367-370
%V 33
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1999__33_3_367_0/
%G en
%F RO_1999__33_3_367_0
Bampis, Evripidis. The complexity of short schedules for uet bipartite graphs. RAIRO - Operations Research - Recherche Opérationnelle, Volume 33 (1999) no. 3, pp. 367-370. http://archive.numdam.org/item/RO_1999__33_3_367_0/

[1] R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Tech. J., 1966, 45, p. 1563-1581. | Zbl

[2] M. R. Garey and D. S. Johnson, Computers and Intractability, Guide to the Theory of NP-completeness, Ed. Freeman, 1979. | MR | Zbl

[3] R. L. Graham, E. L. Lawler, J. K. Lenstra and K. Rinnooy Kan, Optimization and Approximation in Deterministic Scheduling: A Survey, Ann. Disc. Math., 1979, 5, p. 287-326. | MR | Zbl

[4] J. A. Hoogeveen, J. K. Lenstra and B. Veltman, Three, four, five, six or the Complexity of Scheduling with Communication Delays, Oper. Res. Lett, 1994, 16, p. 129-137. | MR | Zbl

[5] J.K. Lenstra and A. H.G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Oper. Res., 1978, 26, p. 22-35. | MR | Zbl

[6] C. H. Papadimitriou and K. Steiglitz "Combinatorial Optimization: Algorithms and Complexity", Prentice-Hall, 1982. | MR | Zbl

[7] C. Picouleau, Étude des problèmes d'optimisation dans les systèmes distribués, Ph.D. Thesis, Université Pierre-et-Marie-Curie, France, 1992.

[8] J. D. Ullman, NP-complete scheduling problems, J. Comp. Syst. Sc., 1975, 10, p. 384-393. | MR | Zbl

[9] R. Saad, Scheduling with Communication Delays, J. Comb. Math. Comb. Comp., 1995, 18, p. 214-224. | MR | Zbl