Pages that link to "Item:Q326478"
From MaRDI portal
The following pages link to Scheduling two job families on a single machine with two competitive agents (Q326478):
Displaying 9 items.
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives (Q2176838) (← links)
- Serial-batching scheduling with two agents to minimize makespan and maximum cost (Q2215193) (← links)
- Online single-machine scheduling to minimize the linear combination of makespans of two agents (Q2234790) (← links)
- Multitasking scheduling problems with two competitive agents (Q5059462) (← links)
- Group Scheduling with Two Competing Agents on a Single Machine (Q5174413) (← links)
- Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs (Q5363760) (← links)
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines (Q6487363) (← links)