Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
From MaRDI portal
Publication:1261479
DOI10.1016/0020-0190(93)90054-DzbMath0781.90049OpenAlexW1986692761WikidataQ57387898 ScholiaQ57387898MaRDI QIDQ1261479
Lucio Bianco, Jacek Błażewicz, Maciej Drozdowski, Paolo Dell'Olmo
Publication date: 17 February 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90054-d
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)
Related Items
Shop scheduling problems with multiprocessor tasks on dedicated processors, Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors, Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness, Scheduling multiprocessor tasks -- An overview
Cites Work
- Unnamed Item
- Unnamed Item
- Preemptive scheduling of independent jobs with release times and deadlines on a hypercube
- Multiprocessor scheduling with communication delays
- Scheduling subject to resource constraints: Classification and complexity
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Scheduling multiprocessor tasks on three dedicated processors
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling preemptive multiprocessor tasks on dedicated processors
