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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of algorithms Ročník 37; číslo 2; s. 422 - 450
Hlavní autoři:	Bar-Noy, Amotz, Halldórsson, Magnús M., Kortsarz, Guy, Salman, Ravit, Shachnai, Hadas
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 01.11.2000 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!