Pages that link to "Item:Q1945095"
From MaRDI portal
The following pages link to GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095):
Displaying 9 items.
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
- Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry (Q2027046) (← links)
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines (Q2290308) (← links)
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)