Scheduling semi-malleable jobs to minimize mean flow time

DOI10.1007/S10951-013-0341-1zbMATH Open1328.90051OpenAlexW2007684460MaRDI QIDQ892832FDOQ892832

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

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

zbMATH Keywords

schedulingpreemptable jobsmean flow time

Mathematics Subject Classification ID

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

Cites Work

• A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
• Title not available (Why is that?)
• Scheduling independent multiprocessor tasks
• Scheduling multiprocessor tasks for mean flow time criterion

Cited In (6)

• Scheduling fully parallel jobs
• Scheduling chains to minimize mean flow time
• Scheduling non-preemptible jobs to minimize peak demand
• Resource loading with time windows
• Malleable scheduling for flows of jobs and applications to MapReduce
• Packing-based branch-and-bound for discrete malleable task scheduling

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)