Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-07557-0_21
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

Mathematical Programming, Series B
MathematicsSoftware
2014English

Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines

2016English

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

Mathematical Formulations for Scheduling Jobs on Identical Parallel Machines With Family Setup Times and Total Weighted Completion Time Minimization

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2019English

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

Unrelated Machine Scheduling of Jobs With Uniform Smith Ratios

2017English

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

Applied and Computational Mathematics
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy