scientific article; zbMATH DE number 7765369

DOI10.4230/lipics.isaac.2020.11arXiv2001.10037MaRDI QIDQ6065401

Mohammad R. Salavatipour, Dylan Hyatt-Denesik, Mirmahdi Rahgoshay

Publication date: 14 November 2023

Full work available at URL: https://arxiv.org/abs/2001.10037

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

schedulingapproximation algorithmsthroughput maximization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Unnamed Item ⋮ Throughput scheduling with equal additive laxity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• On the competitiveness of on-line real-time task scheduling
• On minimizing the weighted number of late jobs in unit execution time open-shops.
• Note on scheduling intervals on-line
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Scheduling time-constrained communication in linear networks
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• Algorithmic graph theory and perfect graphs
• Breaking \(1-1/e\) barrier for non-preemptive throughput maximization
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• A Fast Approximation Scheme for the Multiple Knapsack Problem
• Open Problems in Throughput Scheduling
• Improvements in throughout maximization for real-time scheduling
• Fifty years of scheduling: a survey of milestones
• The Fixed Job Schedule Problem with Working-Time Constraints
• A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• A unified approach to approximating resource allocation and scheduling
• New hardness results for congestion minimization and machine scheduling

This page was built for publication: