Edge-Chromatic Scheduling with Simultaneity Constraints
From MaRDI portal
Recommendations
Cited in
(16)- Extensions of coloring models for scheduling purposes
- The combinatorics of timetabling
- On a multiconstrained model for chromatic scheduling
- Preassignment requirements in chromatic scheduling
- Open shop scheduling with some additional constraints
- Restrictions and preassignments in preemptive open shop scheduling
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Optimal edge-coloring with edge rate constraints
- Chromatic scheduling
- Edge finding for cumulative scheduling
- Resource-sharing systems and hypergraph colorings
- Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions
- Graph endpoint coloring and distributed processing
- Implementation of a university course and examination timetabling system
- Optimizing concurrency under Scheduling by Edge Reversal
- Batch Scheduling with Time Restriction and Clique Search
This page was built for publication: Edge-Chromatic Scheduling with Simultaneity Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302272)