Preassignment requirements in chromatic scheduling
type: Item
instance of: scholarly article
title: Preassignment requirements in chromatic scheduling
zbMATH Open document ID: 0882.90076
DOI: 10.1016/S0166-218X(97)82776-X
author: N. V. R. Mahadev
author: Dominique De Werra
published in: Discrete Applied Mathematics
publication date: 1998-02-24T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1047168
zbMATH Keywords: graph coloring
zbMATH Keywords: open shop
zbMATH Keywords: timetabling
zbMATH Keywords: preassignment
zbMATH Keywords: edge \(k\)-coloring
MaRDI profile type: Publication
cites work: Q3941433
cites work: Precoloring extension. I: Interval graphs
cites work: Q3821925
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q4838466
cites work: The NP-Completeness of Edge-Coloring
cites work: Interval vertex-coloring of a graph with forbidden colors
cites work: Some results concerning the complexity of restricted colorings of graphs
cites work: Interval edge coloring of a graph with forbidden colors
cites work: An introduction to timetabling
cites work: Open shop scheduling with some additional constraints
cites work: Chromatic scheduling and frequency assignment
cites work: Restrictions and preassignments in preemptive open shop scheduling
cites work: Edge-Chromatic Scheduling with Simultaneity Constraints
OpenAlex ID: W2022686688
description: scientific article; zbMATH DE number 1047168