Scheduling multiprocessor tasks for mean flow time criterion

DOI10.1016/S0305-0548(99)00048-9zbMath0955.90033MaRDI QIDQ1977621

Paolo Dell'Olmo, Maciej Drozdowski

Publication date: 4 March 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

complexitydeterministic schedulingmultiprocessor tasksmean flow timeparallel computer systemsparallel identical processorsscheduling multiprocessor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling semi-malleable jobs to minimize mean flow time, A polynomial algorithm for some preemptive multiprocessor task scheduling problems, Hybrid flow-shop scheduling problems with multiprocessor task systems., A note on scheduling multiprocessor tasks with identical processing times., Lower bounds for a bin packing problem with linear usage cost, Computational complexity of some scheduling problems with multiprocessor tasks, Packing-based branch-and-bound for discrete malleable task scheduling, Minimizing total completion time in multiprocessor job systems with energy constraint

Cites Work

• Multiprocessor scheduling with communication delays
• Bin packing with divisible item sizes
• Scheduling multiprocessor tasks -- An overview
• Scheduling with Deadlines and Loss Functions
• Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
• Scheduling File Transfers
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling independent tasks to reduce mean finishing time
• Optimal Linear Ordering
• Unnamed Item
• Unnamed Item