On the complexity of adjacent resource scheduling
type: Item
instance of: scholarly article
title: On the complexity of adjacent resource scheduling
zbMATH Open document ID: 1154.90443
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
full work available at URL: 96102 333fulltext.pdf
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5153354
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: multiprocessor scheduling
zbMATH Keywords: strip packing
zbMATH Keywords: integer programming
author: Cees Duin
author: Erik Van der Sluis
MaRDI profile type: Publication
OpenAlex ID: W1971702637
cites work: Scheduling independent multiprocessor tasks
cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length
cites work: Scheduling multiprocessor tasks on three dedicated processors
cites work: Q4247460
cites work: A polynomial time approximation scheme for general multiprocessor job scheduling
cites work: Scheduling multiprocessor tasks -- An overview
cites work: Complexity of Scheduling Parallel Task Systems
cites work: A typology of cutting and packing problems
cites work: The NP-Completeness of Edge-Coloring
cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations
cites work: The complexity of scheduling independent two-processor tasks on dedicated processors
cites work: Two-dimensional packing problems: a survey
cites work: Q5485395
DOI: 10.1007/S10951-006-5593-6
description: scientific article; zbMATH DE number 5153354