Pages that link to "Item:Q1413905"
From MaRDI portal
The following pages link to Local search for multiprocessor scheduling: how many moves does it take to a local optimum? (Q1413905):
Displaying 4 items.
- Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
- Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
- Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (Q5443371) (← links)