Pages that link to "Item:Q2434316"
From MaRDI portal
The following pages link to Bounded parallel-batching scheduling with two competing agents (Q2434316):
Displaying 5 items.
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
- Two-agent scheduling in a flowshop (Q322895) (← links)
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
- Two-agent scheduling in a two-machine open shop (Q6491675) (← links)