Algorithms with limited number of preemptions for scheduling on parallel machines
type: Item
instance of: scholarly article
title: Algorithms with limited number of preemptions for scheduling on parallel machines
zbMATH Open document ID: 1296.90052
author: Yiwei Jiang
author: Zewei Weng
author: Jueliang Hu
published in: Journal of Combinatorial Optimization
publication date: 2014-06-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6307085
zbMATH Keywords: \(i\)-preemptive scheduling
zbMATH Keywords: approximation algorithm
zbMATH Keywords: worst case ratio
zbMATH Keywords: makespan
MaRDI profile type: Publication
full work available at URL: s10878-012-9545-0
OpenAlex ID: W2294497340
cites work: Parallel Processor Scheduling with Limited Number of Preemptions
cites work: Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
cites work: The power of preemption on unrelated machines and applications to scheduling orders
cites work: Optimal and online preemptive scheduling on uniformly related machines
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: A Level Algorithm for Preemptive Scheduling
cites work: Some Results on Liu’s Conjecture
cites work: The maximum gain of increasing the number of preemptions in multiprocessor scheduling
cites work: Scheduling with deadlines and loss functions
cites work: Minimizing makespan and preemption costs on a system of uniform machines
cites work: A comment on scheduling on uniform machines under chain-type precedence constraints
DOI: 10.1007/S10878-012-9545-0
description: scientific article; zbMATH DE number 6307085