scientific article; zbMATH DE number 1256749

MaRDI QIDQ4228485zbMATH OpenFDO

Authors S. Thomas McCormick

Publication date 1 March 1999

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
• A Fast Parametric Maximum Flow Algorithm and Applications
• scientific article; zbMATH DE number 2080869
• A fast parametric assignment algorithm with applications in max-algebra
• SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
• Approximation algorithms for parallel machine scheduling with speed-up resources
• Approximation Algorithms for the Maximum Concurrent Flow Problem
• Scheduling to minimize max flow time: offline and online algorithms.
• Minimizing maximum flowtime of jobs with arbitrary parallelizability
• A Faster Deterministic Maximum Flow Algorithm

Cited in

(5)

• A fast bipartite network flow algorithm for selective assembly
• The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
• Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
• Parametric matroid interdiction
• On total variation minimization and surface evolution using parametric maximum flows

This page was built for publication:

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