No article text was recorded for this version.
weighted completion time bounds
Version 1 of 146 papers54 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Matroid Coflow Scheduling
- Blog: Minimizing Flow-Time on Unrelated Machines
- Blog: Scheduling Jobs that Arrive Over Time (Extended Abstract)
- Blog: Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees
- Blog: Scheduling with non-renewable resources: minimizing the sum of completion times
- Blog: Unrelated machine scheduling of jobs with uniform smith ratios
- Blog: A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
- Blog: Throughput Maximization in the Speed-Scaling Setting
- Blog: Approximation Algorithms for Scheduling with Resource and Precedence Constraints
- Blog: Non-clairvoyant Scheduling of Coflows
- Blog: A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds
- Blog: A note on scheduling to meet two min-sum objectives
- Blog: Brief announcement: deadline-aware scheduling of big-data processing jobs
- Blog: Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
- Blog: A QPTAS for the General Scheduling Problem with Identical Release Dates
- Blog: Scheduling Maintenance Jobs in Networks
- Blog: Preemptive scheduling of equal-length jobs to maximize weighted throughput
- Blog: Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
- Blog: Approximation Algorithms for Scheduling with Class Constraints
- Blog: Maximizing Throughput in Flow Shop Real-Time Scheduling
- Blog: Lift-and-round to improve weighted completion time on unrelated machines
- Blog: Polynomial Time Algorithms for Minimum Energy Scheduling
- Blog: Throughput Maximization in Multiprocessor Speed-Scaling
- Blog: Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
- Blog: Optimal Strategies of Blotto Games: Beyond Convexity
- Blog: An Almost Tight Lower Bound for the Scheduling Problem to Meet Two Min-Sum Objectives
- Blog: Non-uniform Geometric Set Cover and Scheduling on Multiple Machines
- Blog: Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms
- Blog: Envy-Free Makespan Approximation
- Blog: On (1, ∊)-Restricted Assignment Makespan Minimization
- Blog: Scheduling a Proportionate Flow Shop of Batching Machines
- Blog: A Simpler QPTAS for Scheduling Jobs with Precedence Constraints
- Blog: A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
- Blog: A 1.25(1+ε)-Approximation Algorithm for Scheduling with Rejection Costs Proportional to Processing Times
- Blog: Scheduling to Approximate Minimization Objectives on Identical Machines
- Blog: Revisit the Scheduling Problem with Calibrations
- Blog: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
- Blog: Inner product spaces for MinSum coordination mechanisms
- Blog: No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem
- Blog: Improved Results for Stackelberg Scheduling Strategies
- Blog: Approximation schemes for scheduling on parallel machines
- Blog: Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems
- Blog: Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time
- Blog: The triangle scheduling problem
- Blog: Preemptive and Non-Preemptive Generalized Min Sum Set Cover
- Blog: Weighted Completion Time Minimization for Capacitated Parallel Machines
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_weighted_completion_time_bounds_01ba0f4b,
title = {weighted completion time bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/weighted-completion-time-bounds/rdr_01ba0f4b172347d484071c22b4a65ba0},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_weighted_completion_time_bounds_01ba0f4b_v1,
title = {weighted completion time bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/weighted-completion-time-bounds/rdr_01ba0f4b172347d484071c22b4a65ba0/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}