Efficient Algorithms for Average Completion Time Scheduling
From MaRDI portal
Publication:3569835
DOI10.1007/978-3-642-13036-6_31zbMath1285.90010OpenAlexW1659780652MaRDI QIDQ3569835
Publication date: 22 June 2010
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://degree.ubvu.vu.nl/repec/vua/wpaper/pdf/20090058.pdf
Related Items
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time, Competitive analysis of preemptive single-machine scheduling, An improved analysis of SRPT scheduling algorithm on the basis of functional optimization, An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time, Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms, Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time, A \(2.28\)-competitive algorithm for online scheduling on identical machines, Randomized selection algorithm for online stochastic unrelated machines scheduling, A Tight 2-Approximation for Preemptive Stochastic Scheduling