Amanote Research
Register
Sign In
Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines
doi 10.1145/2935764.2935773
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2016
Authors
Sungjin Im
Janardhan Kulkarni
Publisher
ACM Press
Related search
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
Theory of Computing Systems
Computational Theory
Theoretical Computer Science
Mathematics
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
Mathematical Programming, Series B
Mathematics
Software
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fair Resource Sharing for Dynamic Scheduling of Workflows on Heterogeneous Systems
Online Scheduling With a Buffer on Related Machines
Journal of Combinatorial Optimization
Control
Optimization
Combinatorics
Applied Mathematics
Discrete Mathematics
Computer Science Applications
Mathematics
Computational Theory
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Special Case Algorithm for N-Jobs M-Machines Flow Shop Scheduling Problems
Applied and Computational Mathematics
Scheduling Jobs With Stochastically Ordered Processing Times on Parallel Machines to Minimize Expected Flowtime
Journal of Applied Probability
Mathematics
Statistics
Uncertainty
Probability
Erratum To: Scheduling Jobs on Parallel Machines to Minimize a Regular Step Total Cost Function
Journal of Scheduling
Management Science
Engineering
Operations Research
Artificial Intelligence
Software