Preemptive multiprocessor task scheduling with release times and time windows
type: Item
instance of: scholarly article
title: Preemptive multiprocessor task scheduling with release times and time windows
zbMATH Open document ID: 0888.90085
DOI: 10.1023/A:1018994726051
published in: Annals of Operations Research
publication date: 1998-01-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1094924
zbMATH Keywords: parallel processing
zbMATH Keywords: preemptive deterministic scheduling
zbMATH Keywords: multiprocessor tasks
zbMATH Keywords: time windows
zbMATH Keywords: low-order polynomial time algorithms
author: Lucio Bianco
author: Jacek Blazewicz
author: Paolo Dell'Olmo
author: M. Drozdowski
MaRDI profile type: Publication
full work available at URL: a:1018994726051
OpenAlex ID: W91731887
Wikidata QID: Q57387860
Recommended article: Preemptive Scheduling of Parallel Jobs on Multiprocessors
Recommended article: Q4875180
Recommended article: Q4495070
Recommended article: Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
Recommended article: PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
Recommended article: Preemptive scheduling with deadlines on parallel machines
Recommended article: Preemptive scheduling of periodic jobs in uniform multiprocessor systems
Recommended article: Scheduling preemptable tasks on parallel processors with limited availability
description: scientific article; zbMATH DE number 1094924