Pages that link to "Item:Q2757623"

The following pages link to A PTAS for minimizing the total weighted completion time on identical parallel machines. (Q2757623):

Displaying 27 items.

• Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
• Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
• A note on minimizing the sum of quadratic completion times on two identical parallel machines (Q456107) (← links)
• WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines (Q459788) (← links)
• Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
• A new dynamic programming algorithm for the parallel machines total weighted completion time problem (Q1197881) (← links)
• A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← 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)
• A PTAS for the P-batch scheduling with \(p_j=p\) to minimize total weighted completion time (Q2386615) (← links)
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server (Q2448861) (← links)
• Analysis of Smith's rule in stochastic machine scheduling (Q2450731) (← links)
• Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
• A comment on scheduling two parallel machines with capacity constraints (Q2581321) (← links)
• Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
• The efficiency-fairness balance of round robin scheduling (Q2670464) (← links)
• A PTAS for minimizing the weighted sum of job completion times on parallel machines (Q2819573) (← links)
• Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines (Q2883611) (← links)
• Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
• Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
• Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling (Q3304142) (← links)
• (Q4782744) (← links)
• Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel (Q5438523) (← links)
• Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines (Q6126818) (← links)