Bounds and asymptotic results for the uniform parallel processor weighted flow time problem

DOI10.1016/0167-6377(93)90100-UzbMath0804.90078MaRDI QIDQ1317007

S. T. Webster

Publication date: 19 January 1995

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

asymptotic propertiesparallel processorsweighted flow timeuniform processor problem

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

Effective on-line algorithms for reliable due date quotation and large-scale scheduling ⋮ Weighted flow time bounds for scheduling identical processors ⋮ Scheduling and due‐date quotation in a make‐to‐order supply chain

Cites Work

• Unnamed Item
• Approximation results in parallel machines stochastic scheduling
• Probabilistic analysis of the minimum weighted flowtime scheduling problem
• Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems
• Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
• The Asymptotic Optimality of the LPT Rule
• New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
• Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling
• Scheduling independent tasks to reduce mean finishing time