A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
From MaRDI portal
Publication:2757623
DOI10.1287/moor.25.1.63.15212zbMath1073.90564OpenAlexW2103559566MaRDI QIDQ2757623
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4e23c3312ae5e5220b5bd149b41753db9d836382
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items (14)
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ Unnamed Item ⋮ Unrelated Machine Scheduling with Stochastic Processing Times ⋮ Unrelated parallel machine scheduling with new criteria: complexity and models ⋮ The efficiency-fairness balance of round robin scheduling ⋮ Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines ⋮ Matching based very large-scale neighborhoods for parallel machine scheduling ⋮ Analysis of Smith's rule in stochastic machine scheduling ⋮ 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 ⋮ Scheduling results applicable to decision-theoretic troubleshooting ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ In memoriam: Gerhard Woeginger (1964--2022) ⋮ Performance guarantees of local search for minsum scheduling problems ⋮ Randomized algorithms for on-line scheduling problems: How low can't you go?
This page was built for publication: A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
