Pages that link to "Item:Q2476244"
From MaRDI portal
The following pages link to Batch processing with interval graph compatibilities between tasks (Q2476244):
Displayed 8 items.
- Partitioning a weighted partial order (Q927191) (← links)
- Flowshop scheduling problem with a batching machine and task compatibilities (Q954038) (← links)
- Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
- The vertex coloring problem and its generalizations (Q1022440) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)