Time-sharing scheduling with tolerance capacities

DOI10.1016/j.jcss.2024.103605MaRDI QIDQ6655677

Stavros G. Kolliopoulos, George Karakostas

Publication date: 27 December 2024

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

schedulingtime-sharingtolerance capacities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• The transportation problem with conflicts
• LP based heuristics for the multiple knapsack problem with assignment restrictions
• The Trim Problem
• Better Bin Packing Approximations via Discrepancy Theory
• Tight Approximation Algorithms for Maximum Separable Assignment Problems
• The Santa Claus problem
• A threshold of ln n for approximating set cover
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• A Linear Programming Approach to the Cutting-Stock Problem
• Dependent rounding and its applications to approximation algorithms
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• A new approximation technique for resource‐allocation problems
• Santa Claus Schedules Jobs on Unrelated Machines
• A Quasi-Polynomial Approximation for the Restricted Assignment Problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

This page was built for publication: Time-sharing scheduling with tolerance capacities