Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
type: Item
instance of: scholarly article
title: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
zbMATH Open document ID: 0916.90144
DOI: 10.1016/0377-2217(95)00350-9
author: Peter Brucker
author: Andreas Krämer
published in: European Journal of Operational Research
publication date: 1998-10-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1208474
zbMATH Keywords: job shop
zbMATH Keywords: flow shop
zbMATH Keywords: resource-constrained scheduling
zbMATH Keywords: makespan
zbMATH Keywords: mean flow time
zbMATH Keywords: weighted number of tardy tasks
zbMATH Keywords: polynomial time algorithms
zbMATH Keywords: multiprocessor tasks
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00350-9
OpenAlex ID: W2082853263
cites work: Q3821925
cites work: A linear time algorithm for restricted bin packing and scheduling problems
cites work: Q4023677
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Shop scheduling problems with multiprocessor tasks on dedicated processors
cites work: Q3328583
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations
cites work: An efficient algorithm for a job shop problem
cites work: On Scheduling Independent Tasks with Restricted Execution Times
cites work: Q4872475
cites work: Q3737196
cites work: Multiprocessor scheduling with communication delays
description: scientific article; zbMATH DE number 1208474