Pages that link to "Item:Q2757623"
From MaRDI portal
The following pages link to A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines (Q2757623):
Displaying 14 items.
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
- In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
- Analysis of Smith's rule in stochastic machine scheduling (Q2450731) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
- The efficiency-fairness balance of round robin scheduling (Q2670464) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- (Q3304142) (← links)
- Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines (Q6126818) (← links)
