On a multiconstrained model for chromatic scheduling
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- An introduction to timetabling
- Interval edge coloring of a graph with forbidden colors
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Mixed graph colorings
- On the Complexity of Timetable and Multicommodity Flow Problems
- Restricted coloring models for timetabling
- Restrictions and preassignments in preemptive open shop scheduling
- Two-Processor Scheduling with Start-Times and Deadlines
Cited in
(15)- Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions
- scientific article; zbMATH DE number 151873 (Why is no real title available?)
- An exact method for graph coloring
- A flow based pruning scheme for enumerative equitable coloring algorithms
- Cyclic transfers in school timetabling
- Colouring walls may help to make good schedules.
- An XML format for benchmarks in high school timetabling
- Chromatic scheduling and frequency assignment
- A tutorial on the use of graph coloring for some problems in robotics
- Chromatic scheduling
- Extensions of coloring models for scheduling purposes
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem
- Edge-Chromatic Scheduling with Simultaneity Constraints
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times
- Coloration de graphes : fondements et applications
This page was built for publication: On a multiconstrained model for chromatic scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293198)
