Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

DOI10.1007/11830924_13zbMath1155.90378OpenAlexW2127711047MaRDI QIDQ3595397

Magnús M. Halldórsson, Leah Epstein, Asaf Levin, Hadas Shachnai

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_13

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Batch Coloring Flat Graphs and Thin ⋮ Minimum Weighted Sum Bin Packing ⋮ “Rent-or-Buy” Scheduling and Cost Coloring Problems

This page was built for publication: Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs