Restricted coloring models for timetabling

DOI10.1016/S0012-365X(96)00208-7MaRDI QIDQ1356739zbMATH OpenOpenAlexFDO

Authors 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, https://infoscience.epfl.ch/handle/20.500.14299/233043

zbMATH Keywords

balanced matriceschromatic schedulingnode coloringperfect graphstimetablingtotally unimodular matrices

Mathematics Subject Classification ID

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

Recommendations

• Publication:4934406
• On a multiconstrained model for chromatic scheduling
• Chromatic scheduling
• Some uses of hypergraphs in timetabling
• Extensions of coloring models for scheduling purposes

Cites work

• Balanced matrices
• Bounded vertex colorings of graphs
• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 3841894 (Why is no real title available?)
• scientific article; zbMATH DE number 3666522 (Why is no real title available?)
• scientific article; zbMATH DE number 3557519 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• On perfectness of sums of graphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• Perfect product graphs
• Restrictions and preassignments in preemptive open shop scheduling
• Some results concerning the complexity of restricted colorings of graphs

Cited in

(25)

• Mutual exclusion scheduling with interval graphs or related classes. I
• Extensions of coloring models for scheduling purposes
• The combinatorics of timetabling
• On a multiconstrained model for chromatic scheduling
• On the complexity of a restricted list-coloring problem
• Complexity of list coloring problems with a fixed total number of colors
• Complexity of some special types of timetabling problems
• 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
• Scheduling jobs on identical machines with agreement graph
• Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
• Bounded colouring motivated by the limited resource partially concurrent open shop problem
• Proportional choosability: a new list analogue of equitable coloring
• New results in two identical machines scheduling with agreement graphs
• Mutual exclusion scheduling with interval graphs or related classes. II
• Edge coloring: a natural model for sports scheduling
• Some uses of hypergraphs in timetabling
• scientific article; zbMATH DE number 1390136 (Why is no real title available?)
• “Rent-or-Buy” Scheduling and Cost Coloring Problems
• A supernodal formulation of vertex colouring with applications in course timetabling
• Scheduling with machine conflicts
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times
• Coloring and recognizing mixed interval graphs
• A survey of search methodologies and automated system development for examination timetabling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356739)