Little-preemptive scheduling on unrelated processors
type: Item
instance of: scholarly article
title: Little-preemptive scheduling on unrelated processors
zbMATH Open document ID: 1064.68025
DOI: 10.1023/A:1015674704111
author: Nodari Vakhania
author: Evgeny V. Shchepin
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2003-04-27T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1901343
zbMATH Keywords: scheduling
zbMATH Keywords: unrelated processors
zbMATH Keywords: preemption
zbMATH Keywords: acyclic distribution
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: a:1015674704111
OpenAlex ID: W1534810249
Recommended article: On the complexity of constructing multiprocessor little-preemptive schedules
Recommended article: Optimal Preemptive Scheduling of Two Unrelated Processors
Recommended article: Preemptive Scheduling of Uniform Processor Systems
Recommended article: Nonpreemptive scheduling of independent tasks with prespecified processor allocations
Recommended article: Real-time uniprocessor scheduling with fewer preemptions
Recommended article: Preemptive and non-preemptive scheduling on two unrelated parallel machines
Recommended article: Scheduling Independent Tasks on Uniform Processors
Recommended article: Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
Recommended article: Preemptive scheduling on a small number of hierarchical machines
Recommended article: APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
description: scientific article; zbMATH DE number 1901343