A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
type: Item
instance of: scholarly article
title: A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
zbMATH Open document ID: 1337.68045
DOI: 10.1016/S0020-0190(97)00119-1
author: A. K. Amoura
published in: Information Processing Letters
publication date: 2016-05-26T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6585453
zbMATH Keywords: parallel processing
zbMATH Keywords: scheduling
zbMATH Keywords: precedence constraints
zbMATH Keywords: computational complexity
zbMATH Keywords: polynomial time algorithm
MaRDI profile type: Publication
cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length
cites work: Scheduling multiprocessor tasks with chain constraints
cites work: Optimal scheduling for two-processor systems
cites work: Q3218080
cites work: Scheduling multiprocessor tasks -- An overview
cites work: Optimal Sequencing of Two Equivalent Processors
cites work: An Almost-Linear Algorithm for Two-Processor Scheduling
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: `` Strong '' NP-Completeness Results
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Concurrent Task Systems
cites work: Scheduling Interval-Ordered Tasks
cites work: Multiprocessor scheduling with communication delays
full work available at URL: s0020-0190(97)00119-1
OpenAlex ID: W2081894714
description: scientific article; zbMATH DE number 6585453