The complexity of scheduling independent two-processor tasks on dedicated processors
type: Item
instance of: scholarly article
title: The complexity of scheduling independent two-processor tasks on dedicated processors
zbMATH Open document ID: 0653.68015
DOI: 10.1016/0020-0190(87)90176-1
author: Marek Kubale
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 4066309
zbMATH Keywords: computational complexity
zbMATH Keywords: edge coloring
zbMATH Keywords: NP-completeness
zbMATH Keywords: two-processor task scheduling
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90176-1
OpenAlex ID: W2063957224
cites work: Scheduling independent 2-processor tasks to minimize schedule length
cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length
cites work: On Edge Coloring Bipartite Graphs
cites work: The NP-Completeness of Edge-Coloring
cites work: Q3971918
cites work: Linear algorithms for edge-coloring trees and unicyclic graphs
cites work: Q3693539
cites work: Q3325753
cites work: On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
description: scientific article; zbMATH DE number 4066309