Pages that link to "Item:Q5963621"
From MaRDI portal
The following pages link to Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621):
Displaying 10 items.
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks (Q1753463) (← links)
- Approximation schemes for two-agent scheduling on parallel machines (Q1935796) (← links)
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468) (← links)
- Online single-machine scheduling to minimize the linear combination of makespans of two agents (Q2234790) (← 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)
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877) (← links)
