Pages that link to "Item:Q2317128"
From MaRDI portal
The following pages link to An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines (Q2317128):
Displaying 10 items.
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
- Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent (Q827243) (← links)
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (Q1768611) (← 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)
- 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)
- Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877) (← links)
