Time-sharing scheduling with tolerance capacities

DOI10.1016/J.JCSS.2024.103605MaRDI QIDQ6655677zbMATH OpenFDO

Authors George Karakostas, Stavros G. Kolliopoulos

Publication date 27 December 2024

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

Full work available at URL https://doi.org/10.1016/J.JCSS.2024.103605

zbMATH Keywords

schedulingtime-sharingtolerance capacities

Mathematics Subject Classification ID

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

Recommendations

• Resource constrained scheduling on multiple machines
• Approximating Scheduling Machines with Capacity Constraints
• Scheduling to Minimize Maximum Workload
• Real-time scheduling to minimize machine busy times
• Machine scheduling with resource dependent processing times

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• A new approximation technique for resource-allocation problems
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• A quasi-polynomial approximation for the restricted assignment problem
• A threshold of ln n for approximating set cover
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Better bin packing approximations via discrepancy theory
• Dependent rounding and its applications to approximation algorithms
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• LP based heuristics for the multiple knapsack problem with assignment restrictions
• Maximizing a monotone submodular function subject to a matroid constraint
• Maximizing submodular set functions subject to multiple linear constraints
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• The Santa Claus problem
• The transportation problem with conflicts
• The trim problem
• Tight approximation algorithms for maximum separable assignment problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655677)