A hypocoloring model for batch scheduling
type: Item
instance of: scholarly article
title: A hypocoloring model for batch scheduling
zbMATH Open document ID: 1115.68118
author: Dominique De Werra
author: Vangelis Th. Paschos
author: Marc Demange
author: Jérôme Monnot
published in: Discrete Applied Mathematics
publication date: 2005-02-23T00:00:00Z
full work available at URL: https://basepub.dauphine.fr/handle/123456789/2480
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2137374
zbMATH Keywords: Batch scheduling
zbMATH Keywords: Graph coloring
zbMATH Keywords: Subcolorings
zbMATH Keywords: Hypocolorings
zbMATH Keywords: Weighted colorings
zbMATH Keywords: Approximability
zbMATH Keywords: NP-complete
zbMATH Keywords: chromatic scheduling
MaRDI profile type: Publication
OpenAlex ID: W2052644051
cites work: The subchromatic number of a graph
cites work: Q3856672
cites work: Q3941433
cites work: Scheduling with incompatible jobs
cites work: Q5431779
cites work: More about subcolorings
cites work: Q5782525
cites work: On generalized graph colorings
cites work: Q4414490
cites work: Graph Subcolorings: Complexity and Algorithms
cites work: Q4198056
cites work: Q3220612
cites work: Q5530470
cites work: The thickness of graphs: A survey
cites work: On the complexity of decomposing matrices arising in satellite communication
cites work: The complexity of satisfiability problems
DOI: 10.1016/J.DAM.2004.06.016
description: scientific article; zbMATH DE number 2137374