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

DOI10.1287/opre.32.2.440zbMath0573.90054OpenAlexW2164278127MaRDI QIDQ3691406

No author found.

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

parallel identical processorsminimizing total flow timevariable unit processing time

Mathematics Subject Classification ID

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

Related Items (5)

Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ 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 ⋮ Scheduling problems with a common due window assignment: A survey

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