Pages that link to "Item:Q880586"
From MaRDI portal
The following pages link to Time slot scheduling of compatible jobs (Q880586):
Displaying 23 items.
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- On the max coloring problem (Q690449) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- A connection between circular colorings and periodic schedules (Q1028150) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- Scheduling incompatible tasks on two machines (Q1042485) (← links)
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths (Q1179200) (← links)
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
- Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- Optimal shift coloring of trees (Q1785225) (← links)
- Improved approximation algorithms for the max edge-coloring problem (Q1944142) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- Solution methods for a scheduling problem with incompatibility and precedence constraints (Q2865858) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results (Q3181046) (← links)
- On the Max Coloring Problem (Q5443379) (← links)
- Comparability graph augmentation for some multiprocessor scheduling problems (Q5961606) (← links)