Pages that link to "Item:Q5960733"
From MaRDI portal
The following pages link to Scheduling tasks on unrelated machines: large neighborhood improvement procedures (Q5960733):
Displaying 6 items.
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
