Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time

DOI10.1287/OPRE.32.2.440MaRDI QIDQ3691406zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

minimizing total flow timeparallel identical processorsvariable unit processing time

Mathematics Subject Classification ID

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

Recommendations

• On Minimizing Flow Time on Processors with Variable Unit Processing Time
• Minimizing Schedule Length Subject to Minimum Flow Time
• SPT is optimally competitive for uniprocessor flow
• Minimizing mean flow time with parallel processors and resource constraints
• Minimizing makespan subject to minimum total flow-time on identical parallel machines

Cited in

(9)

• Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
• A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
• A unified view of parallel machine scheduling with interdependent processing rates
• SPT is optimally competitive for uniprocessor flow
• Scheduling problems with a common due window assignment: a survey
• On Minimizing Flow Time on Processors with Variable Unit Processing Time
• Minimizing Schedule Length Subject to Minimum Flow Time
• Batching to Minimize Flow Times on Parallel Heterogeneous Machines
• Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds

This page was built for publication: Minimizing Flow Time on Parallel Identical 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 Q3691406)