Pages that link to "Item:Q2583507"
From MaRDI portal
The following pages link to Scheduling on a batch processing machine with split compatibility graphs (Q2583507):
Displaying 10 items.
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Scheduling with undirected graphs: motivations and reviews (Q1031075) (← links)
- Dynamic scheduling on a single batch processing machine with split compatibility graphs (Q1398019) (← links)
- Scheduling a batch processing machine with bipartite compatibility graphs (Q1423703) (← links)
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery (Q2176828) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
- (Q3806971) (← links)