New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines

Theory of Computing Systems- United States

doi 10.1007/s00224-019-09927-x

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Science and Business Media LLC

Related search

Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines

2016English

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

Duality-Based Algorithms for Scheduling Unrelated Parallel Machines

ORSA Journal on Computing
1993English

A Unified Approach to Scheduling on Unrelated Parallel Machines

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2009English

Approximability of Average Completion Time Scheduling on Unrelated Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

A Multi-Criteria Decision Making for the Unrelated Parallel Machines Scheduling Problem

Journal of Software Engineering and Applications
2009English

Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines With Machine Eligibility Constraints

Mathematical Problems in Engineering
MathematicsEngineering
2018English

Stochastic Load Balancing on Unrelated Machines

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy