Preemptive multiprocessor task scheduling with release times and time windows

DOI10.1023/A:1018994726051zbMath0888.90085OpenAlexW91731887MaRDI QIDQ1374419

Jacek Błażewicz, Maciej Drozdowski, Lucio Bianco, Paolo Dell'Olmo

Publication date: 28 January 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018994726051

zbMATH Keywords

parallel processingtime windowsmultiprocessor taskslow-order polynomial time algorithmspreemptive deterministic scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Parallel numerical computation (65Y05)

Related Items (2)

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints ⋮ Scheduling multiprocessor tasks -- An overview

This page was built for publication: Preemptive multiprocessor task scheduling with release times and time windows