The complexity of short schedules for uet bipartite graphs

Evripidis Bampis

RAIRO - Operations Research - Recherche Opérationnelle (1999)

  • Volume: 33, Issue: 3, page 367-370
  • ISSN: 0399-0559

How to cite

top

Bampis, Evripidis. "The complexity of short schedules for uet bipartite graphs." RAIRO - Operations Research - Recherche Opérationnelle 33.3 (1999): 367-370. <http://eudml.org/doc/105195>.

@article{Bampis1999,
author = {Bampis, Evripidis},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {schedule; multiprocessor; bipartite graph; complexity; multiprocessor scheduling problem},
language = {eng},
number = {3},
pages = {367-370},
publisher = {EDP-Sciences},
title = {The complexity of short schedules for uet bipartite graphs},
url = {http://eudml.org/doc/105195},
volume = {33},
year = {1999},
}

TY - JOUR
AU - Bampis, Evripidis
TI - The complexity of short schedules for uet bipartite graphs
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1999
PB - EDP-Sciences
VL - 33
IS - 3
SP - 367
EP - 370
LA - eng
KW - schedule; multiprocessor; bipartite graph; complexity; multiprocessor scheduling problem
UR - http://eudml.org/doc/105195
ER -

References

top
  1. [1] R. L. GRAHAM, Bounds for Certain Multiprocessing Anomalies, Bell System Tech. J., 1966, 45, p. 1563-1581. Zbl0168.40703
  2. [2] M. R. GAREY and D. S. JOHNSON, Computers and Intractability, Guide to the Theory of NP-completeness, Ed. Freeman, 1979. Zbl0411.68039MR519066
  3. [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. Zbl0411.90044MR558574
  4. [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. Zbl0816.90083MR1306216
  5. [5] J.K. LENSTRA and A. H.G. RINNOOY KAN, Complexity of scheduling under precedence constraints, Oper. Res., 1978, 26, p. 22-35. Zbl0371.90060MR462553
  6. [6] C. H. PAPADIMITRIOU and K. STEIGLITZ"Combinatorial Optimization: Algorithms and Complexity", Prentice-Hall, 1982. Zbl0503.90060MR663728
  7. [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. [8] J. D. ULLMAN, NP-complete scheduling problems, J. Comp. Syst. Sc., 1975, 10, p. 384-393. Zbl0313.68054MR391585
  9. [9] R. SAAD, Scheduling with Communication Delays, J. Comb. Math. Comb. Comp., 1995, 18, p. 214-224. Zbl0833.68019MR1334650

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.