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 14 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)
- Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
- Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times (Q2243380) (← links)
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
- Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem (Q2273695) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints (Q2294600) (← links)
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
- A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)