Scheduling semi-malleable jobs to minimize mean flow time

DOI10.1007/S10951-013-0341-1MaRDI QIDQ892832zbMATH OpenOpenAlexFDO

Authors Yann Hendel, Denis Trystram, Wieslaw 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

mean flow timepreemptable jobsscheduling

Mathematics Subject Classification ID

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

Recommendations

• Job scheduling to minimize expected weighted flowtime on uniform processors
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Scheduling chains to minimize mean flow time
• Malleable scheduling for flows of jobs and applications to MapReduce
• Scheduling in flowshops to minimize total tardiness of jobs
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Optimal job scheduling for flowshops
• scientific article; zbMATH DE number 4064442
• Minimizing maximum flowtime of jobs with arbitrary parallelizability
• Preemptive scheduling to minimize mean weighted flow time

Cites work

• A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
• scientific article; zbMATH DE number 1003247 (Why is no real title available?)
• Scheduling independent multiprocessor tasks
• Scheduling multiprocessor tasks for mean flow time criterion

Cited in

(7)

• A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
• Packing-based branch-and-bound for discrete malleable task scheduling
• Malleable scheduling for flows of jobs and applications to MapReduce
• Scheduling fully parallel jobs
• Scheduling non-preemptible jobs to minimize peak demand
• Scheduling chains to minimize mean flow time
• Resource loading with time windows

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

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