Scheduling independent two processor tasks on a uniform duo-processor system
type: Item
instance of: scholarly article
title: Scheduling independent two processor tasks on a uniform duo-processor system
zbMATH Open document ID: 0715.90069
DOI: 10.1016/0166-218X(90)90090-Y
author: Jacek Blazewicz
author: Dominique De Werra
author: M. Drozdowski
author: Günter Schmidt
published in: Discrete Applied Mathematics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 4179132
zbMATH Keywords: scheduling multiprocessor tasks
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: preemptive scheduling
MaRDI profile type: Publication
Wikidata QID: Q57387914
cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length
cites work: Scheduling independent 2-processor tasks to minimize schedule length
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: Q3339651
cites work: Scheduling on semi-identical processors
full work available at URL: 0166-218x(90)90090-y
OpenAlex ID: W2018494064
Recommended article: Q3818115
Recommended article: Scheduling independent 2-processor tasks to minimize schedule length
Recommended article: Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
Recommended article: Scheduling Independent Tasks on Uniform Processors
Recommended article: Q3838196
Recommended article: Scheduling multiprocessor tasks on two parallel processors
Recommended article: Scheduling UET task systems with concurrency on two parallel identical processors
Recommended article: An approximation result for a duo-processor task scheduling problem
Recommended article: Optimal scheduling for two-processor systems
Recommended article: Scheduling Independent Tasks with Deadlines on Semi-identical Processors
description: scientific article; zbMATH DE number 4179132