Approximability of Average Completion Time Scheduling on Unrelated Machines

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-87744-8_64
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Approximability of Average Completion Time Scheduling Under Precedence Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

On the Approximability of Average Completion Time Scheduling Under Precedence Constraints

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2003English

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

2020English

A Unified Approach to Scheduling on Unrelated Parallel Machines

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2009English

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

New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2019English

Duality-Based Algorithms for Scheduling Unrelated Parallel Machines

ORSA Journal on Computing
1993English

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

Mathematical Problems in Engineering
MathematicsEngineering
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy