Sum Multicoloring of Graphs

Scheduling dependent jobs on multiple machines is modeled by the graph multicoloring problem. In this paper we consider the problem of minimizing the average completion time of all jobs. This is formalized as the sum multicoloring problem: Given a graph and the number of colors required by each vert...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of algorithms Jg. 37; H. 2; S. 422 - 450
Hauptverfasser:	Bar-Noy, Amotz, Halldórsson, Magnús M., Kortsarz, Guy, Salman, Ravit, Shachnai, Hadas
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 01.11.2000 Elsevier
Schlagworte:	Applied sciences chromatic sums Combinatorics Combinatorics. Ordered structures dependent jobs dining philosophers Exact sciences and technology graph coloring Graph theory Mathematics multicoloring Operational research and scientific management Operational research. Management science scheduling Scheduling, sequencing Sciences and techniques of general use sum coloring chromatic sums scheduling dining philosophers graph coloring multicoloring dependent jobs sum coloring Starvation Operations research Dining philosopher Scheduling Graph theory Multicoloring Management Optimization Dependence Graph colouring Chromatic graph dependent job Chromatic sum
ISSN:	0196-6774, 1090-2678
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!