Pages that link to "Item:Q1398019"
From MaRDI portal
The following pages link to Dynamic scheduling on a single batch processing machine with split compatibility graphs (Q1398019):
Displaying 11 items.
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Scheduling with undirected graphs: motivations and reviews (Q1031075) (← links)
- Scheduling incompatible tasks on two machines (Q1042485) (← links)
- Scheduling a batch processing machine with bipartite compatibility graphs (Q1423703) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
- No-Wait Scheduling Problems with Batching Machines (Q2958672) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times (Q5058723) (← links)