The power of preemption on unrelated machines and applications to scheduling orders
type: Item
instance of: scholarly article
zbMATH Open document ID: 1238.90062
author: José R. Correa
author: José Verschae
author: Martin Skutella
published in: Mathematics of Operations Research
publication date: 2012-05-24T00:00:00Z
full work available at URL: http://hdl.handle.net/10533/138162
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6038637
zbMATH Keywords: machine scheduling
zbMATH Keywords: approximation algorithms
Wikidata QID: Q65553903
MaRDI profile type: Publication
OpenAlex ID: W1987536045
DOI: 10.1287/MOOR.1110.0520
Recommended article: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Recommended article: On the complexity of scheduling unrelated parallel machines with limited preemptions
Recommended article: Q4234110
Recommended article: Bounding the Power of Preemption in Randomized Scheduling
Recommended article: Q5399877
Recommended article: Scheduling on unrelated machines under tree-like precedence constraints
Recommended article: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Recommended article: Preemptive and non-preemptive scheduling on two unrelated parallel machines
Recommended article: Power of Preemption on Uniform Parallel Machines
Recommended article: Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
title: The power of preemption on unrelated machines and applications to scheduling orders
description: scientific article; zbMATH DE number 6038637