Pages that link to "Item:Q283263"
From MaRDI portal
The following pages link to A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263):
Displaying 11 items.
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
- An approximation algorithm for scheduling on three dedicated machines (Q1897367) (← links)
- Approximation schemes for two-agent scheduling on parallel machines (Q1935796) (← links)
- Two-agent scheduling on a single machine with release dates (Q2273652) (← links)
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← links)
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines (Q2317128) (← links)
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans (Q2410095) (← links)
- Two-agent vehicle scheduling problem on a line-shaped network (Q2691417) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877) (← links)
