On Minimizing Flow Time on Processors with Variable Unit Processing Time

DOI10.1287/OPRE.34.5.801MaRDI QIDQ3755220zbMATHOpenAlexFDO

Authors

Publication date 1986

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.34.5.801

zbMATH Keywords

shortest processing timeparallel identical processorsinterchange techniqueunequal starting times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time
• Minimizing mean flow time with parallel processors and resource constraints
• Mean flow time minimization with given bounds of processing times
• Notes on max flow time minimization with controllable processing times
• Minimizing flow-time on unrelated machines
• Minimizing flow-time on a single machine with integer batch sizes
• On minimizing the total flow time on multiple machines
• Minimizing maximum flowtime of jobs with arbitrary parallelizability
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
• An algorithm for flow time minimization and its asymptotic makespan properties

Cited in

(4)

• Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time
• A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
• Efficient vector time with dynamic process creation and termination
• A unified view of parallel machine scheduling with interdependent processing rates

This page was built for publication: On Minimizing Flow Time on Processors with Variable Unit Processing Time

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