Extensions of coloring models for scheduling purposes
From MaRDI portal
Publication:1268282
Recommendations
- scientific article; zbMATH DE number 7203465
- Restricted coloring models for timetabling
- scientific article; zbMATH DE number 1594564
- Scheduling Problems and Mixed Graph Colorings
- A graph coloring algorithm for large scale scheduling problems
- Plurigraph coloring and scheduling problems
- scientific article; zbMATH DE number 1947044
- On a multiconstrained model for chromatic scheduling
Cites work
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem
- Balanced matrices
- Compact Cylindrical Chromatic Scheduling
- Cyclic Scheduling via Integer Programs with Circular Ones
- Edge-Chromatic Scheduling with Simultaneity Constraints
- scientific article; zbMATH DE number 4095196 (Why is no real title available?)
- scientific article; zbMATH DE number 108110 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3325507 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 4187836 (Why is no real title available?)
- Interval edge coloring of a graph with forbidden colors
- On cyclic sequence types for constructing cyclic schedules
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Open shop problem with zero-one time operations and integer release date/deadline intervals
- Open Shop Scheduling to Minimize Finish Time
- Open shop scheduling with some additional constraints
- Parallel concepts in graph theory
- Restrictions and preassignments in preemptive open shop scheduling
- Some graph‐theoretical models for scheduling in automated production systems
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
- Some results concerning the complexity of restricted colorings of graphs
- Two-Machine Open Shops with Renewable Resources
Cited in
(17)- The combinatorics of timetabling
- On a multiconstrained model for chromatic scheduling
- Restricted coloring models for timetabling
- Preassignment requirements in chromatic scheduling
- Complexity of some special types of timetabling problems
- The robust coloring problem.
- A generalized class-teacher model for some timetabling problems
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- Mutual exclusion scheduling with interval graphs or related classes. II
- Mathematical programming models and algorithms for a class--faculty assignment problem
- Inverse chromatic number problems in interval and permutation graphs
- Edge coloring: a natural model for sports scheduling
- scientific article; zbMATH DE number 151873 (Why is no real title available?)
- Edge-Chromatic Scheduling with Simultaneity Constraints
- Interval edge-coloring: A model of curriculum scheduling
- scientific article; zbMATH DE number 7203465 (Why is no real title available?)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems
This page was built for publication: Extensions of coloring models for scheduling purposes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268282)
