Deadline scheduling of tasks with ready times and resource constraints
type: Item
instance of: scholarly article
title: Deadline scheduling of tasks with ready times and resource constraints
zbMATH Open document ID: 0401.90048
DOI: 10.1016/0020-0190(79)90143-1
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3623277
zbMATH Keywords: Deadline Scheduling
zbMATH Keywords: Ready Times
zbMATH Keywords: Resource Constraints
zbMATH Keywords: Parallel Processors
zbMATH Keywords: Computational Complexity
Wikidata QID: Q57387941
author: Jacek Blazewicz
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90143-1
OpenAlex ID: W1985064863
cites work: On the computational power of pushdown automata
cites work: Q4131656
cites work: Simple algorithms for multiprocessor scheduling to meet deadlines
cites work: Q4136574
cites work: Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
cites work: Q4131987
cites work: Scheduling Tasks with Nonuniform Deadlines on Two Processors
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4142699
cites work: Minimizing maximum lateness on one machine: computational experience and some applications
cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
DBLP publication ID: journals/ipl/Blazewicz79
description: scientific article; zbMATH DE number 3623277