Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines

doi 10.1145/2935764.2935773

Full Text

Abstract

Available in

Date

Authors

Publisher

ACM Press

Related search

New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2019English

Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

Mathematical Programming, Series B
MathematicsSoftware
2014English

Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Fair Resource Sharing for Dynamic Scheduling of Workflows on Heterogeneous Systems

2014English

Online Scheduling With a Buffer on Related Machines

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2008English

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Special Case Algorithm for N-Jobs M-Machines Flow Shop Scheduling Problems

Applied and Computational Mathematics
2017English

Scheduling Jobs With Stochastically Ordered Processing Times on Parallel Machines to Minimize Expected Flowtime

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
1986English

Erratum To: Scheduling Jobs on Parallel Machines to Minimize a Regular Step Total Cost Function

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy