Preemptive multiprocessor task scheduling with release times and time windows

DOI10.1023/A:1018994726051MaRDI QIDQ1374419zbMATH OpenOpenAlexWikidataFDO

Authors Lucio Bianco, Jacek Blazewicz, Paolo Dell'Olmo, M. Drozdowski

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

time windowsparallel processingmultiprocessor taskslow-order polynomial time algorithmspreemptive deterministic scheduling

Mathematics Subject Classification ID

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

Recommendations

• Preemptive Scheduling of Parallel Jobs on Multiprocessors
• scientific article; zbMATH DE number 871911
• scientific article; zbMATH DE number 1487943
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
• Preemptive scheduling with deadlines on parallel machines
• Preemptive scheduling of periodic jobs in uniform multiprocessor systems
• Scheduling preemptable tasks on parallel processors with limited availability

Cited in

(6)

• Scheduling multiprocessor tasks -- An overview
• A polynomial algorithm for some preemptive multiprocessor task scheduling problems
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
• Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
• A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
• Scheduling multiprocessor tasks on two parallel processors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374419)