Scheduling via mixed graph coloring
From MaRDI portal
Recommendations
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
- scientific article; zbMATH DE number 1731177
- Scheduling Problems and Mixed Graph Colorings
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- Parameterized mixed graph coloring
Cited in
(17)- Mixed graph edge coloring
- Extensions of coloring models for scheduling purposes
- Parameterized mixed graph coloring
- On two coloring problems in mixed graphs
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
- scientific article; zbMATH DE number 1731177 (Why is no real title available?)
- Solution methods for a scheduling problem with incompatibility and precedence constraints
- Scheduling Problems and Mixed Graph Colorings
- 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
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times
- List-graph colouring for multiple depot vehicle scheduling
- Coloring some classes of mixed graphs
- Using mixed graph coloring to minimize total completion time in job shop scheduling
This page was built for publication: Scheduling via mixed graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2712373)