Restricted coloring models for timetabling

DOI10.1016/S0012-365X(96)00208-7zbMath0876.90060OpenAlexW2012929820MaRDI QIDQ1356739

Dominique de Werra

Publication date: 1 December 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00208-7

zbMATH Keywords

timetablingperfect graphstotally unimodular matriceschromatic schedulingnode coloringbalanced matrices

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (17)

A survey of search methodologies and automated system development for examination timetabling ⋮ Complexity of list coloring problems with a fixed total number of colors ⋮ New results in two identical machines scheduling with agreement graphs ⋮ Scheduling with machine conflicts ⋮ Partially concurrent open shop scheduling with integral preemptions ⋮ A flow based pruning scheme for enumerative equitable coloring algorithms ⋮ Solving university course timetabling problems using constriction particle swarm optimization with local search ⋮ Bounded colouring motivated by the limited resource partially concurrent open shop problem ⋮ Mutual exclusion scheduling with interval graphs or related classes. II ⋮ Scheduling jobs on identical machines with agreement graph ⋮ Mutual exclusion scheduling with interval graphs or related classes. I ⋮ The combinatorics of timetabling ⋮ Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs ⋮ Proportional choosability: a new list analogue of equitable coloring ⋮ On a multiconstrained model for chromatic scheduling ⋮ On the complexity of a restricted list-coloring problem ⋮ Complexity of some special types of timetabling problems

Cites Work

• Bounded vertex colorings of graphs
• Some results concerning the complexity of restricted colorings of graphs
• Perfect product graphs
• On perfectness of sums of graphs
• Restrictions and preassignments in preemptive open shop scheduling
• On the Complexity of Timetable and Multicommodity Flow Problems
• Balanced matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Restricted coloring models for timetabling