Select and permute: an improved online framework for scheduling to minimize weighted completion time
DOI10.1007/978-3-319-77404-6_49zbMath1505.90059arXiv1704.06677OpenAlexW2608554824WikidataQ127486719 ScholiaQ127486719MaRDI QIDQ5919414
Jingling Li, Pascal Sturmfels, Prayaag Venkat, Samir Khuller, Kevin Sun
Publication date: 12 February 2020
Published in: Theoretical Computer Science, LATIN 2018: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.06677
Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (4)
Cites Work
- Unnamed Item
- Minimizing the sum of weighted completion times in a concurrent open shop
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- A note on the complexity of the concurrent open shop problem
- Scheduling orders for multiple product types to minimize total weighted completion time
- On scheduling coflows (extended abstract)
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
- A Dynamic Programming Approach to Sequencing Problems
- Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- A New Approach to Online Scheduling
- Order Scheduling Models: Hardness and Algorithms
This page was built for publication: Select and permute: an improved online framework for scheduling to minimize weighted completion time
