Pages that link to "Item:Q967430"
From MaRDI portal
The following pages link to A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (Q967430):
Displaying 6 items.
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Equitable coloring of hypergraphs (Q2414464) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling (Q5497725) (← links)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)
