Pages that link to "Item:Q336380"
From MaRDI portal
The following pages link to An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380):
Displaying 5 items.
- Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← links)
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
