Pages that link to "Item:Q2884532"
From MaRDI portal
The following pages link to Experimental comparison of approximation algorithms for scheduling unrelated parallel machines (Q2884532):
Displaying 14 items.
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
- Processing time generation schemes for parallel machine scheduling problems with various correlation structures (Q490376) (← links)
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284) (← links)
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling (Q2108101) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications (Q3635039) (← links)
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs (Q6565429) (← links)
