Scheduling semi-malleable jobs to minimize mean flow time

DOI10.1007/S10951-013-0341-1zbMath1328.90051OpenAlexW2007684460MaRDI QIDQ892832

Yann Hendel, Denis Trystram, Wiesław X. Kubiak

Publication date: 12 November 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0341-1

zbMATH Keywords

schedulingpreemptable jobsmean flow time

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Resource loading with time windows ⋮ Scheduling fully parallel jobs ⋮ Packing-based branch-and-bound for discrete malleable task scheduling

Cites Work

• Unnamed Item
• A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
• Scheduling multiprocessor tasks for mean flow time criterion
• Scheduling independent multiprocessor tasks

This page was built for publication: Scheduling semi-malleable jobs to minimize mean flow time