\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
type: Item
instance of: scholarly article
title: \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
zbMATH Open document ID: 0857.90056
DOI: 10.1016/0167-6377(95)00031-9
author: Michael R. Fellows
author: Hans L. Bodlaender
published in: Operations Research Letters
publication date: 1996-08-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 912517
zbMATH Keywords: multiprocessor scheduling
zbMATH Keywords: partial orders
zbMATH Keywords: precedence constrained \(K\)-processor scheduling
zbMATH Keywords: parameterized complexity
Wikidata QID: Q59567993
MaRDI profile type: Publication
full work available at URL: 0167-6377(95)00031-9
OpenAlex ID: W2029604753
cites work: Q4281539
cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
cites work: Q4273870
cites work: Q4291429
cites work: The parameterized complexity of sequence alignment and consensus
cites work: Domino Treewidth
cites work: Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
cites work: On the parameterized complexity of short computation and factorization
cites work: Q4281497
cites work: Q4850549
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q4501141
cites work: Q4279511
cites work: Erratum “Optimal Sequencing of Two Equivalent Processors”
cites work: Q4198056
description: scientific article; zbMATH DE number 912517